Matches in SemOpenAlex for { <https://semopenalex.org/work/W86959611> ?p ?o ?g. }
Showing items 1 to 88 of
88
with 100 items per page.
- W86959611 abstract "This thesis is divided into four chapters. In the first chapter we describe the subtleties involved in probabilistically analyzing simple algorithms in computational geometry. We also work through a few easy examples of such analyses. The first example analyzes Quicksort, the second analyzes Quickhull, and the third analyzes interpoint distances between uniformly distributed points in hypercubes or hypertori.In the second chapter we present a simple but effective preprocessing algorithm for calculating convex hulls. The algorithm is short and intuitive. It does a fast linear scan through the points, identifying many which are not on the convex hull and can therefore be eliminated. We perform an exact analysis of this algorithm showing that, given n points distributed uniformly in the unit square, only about 8$sqrt{n}$ of them remain after the preprocessing step: in higher dimensions only $csb{d}nsp{1-1/d}$ will remain. We present the results of simulations comparing our mathematical analysis to reality. Finally, we end with a discussion of what distinguishes this algorithm from certain obvious variants.In the third chapter we analyze closest pair algorithms. First, we analyze a sweep-line closest-pair algorithm, one similar in spirit to Hoey and Shamos' divide and conquer algorithm for solving the same problem. Our result is that, given n points uniformly distributed in the unit square and then sorted, there is a six line algorithm that finds the closest pair in O(n) expected time. Moreover, this algorithm uses no complicated data structures. We then analyze a second algorithm, one that finds the closest pair using a modified version of Bentley and Papadimitriou's nearest neighbor projection algorithm. Our result, again, is that after the sorting stage, the linear scan stage of this new algorithm also finds the closest pair in O(n) expected time.The fourth chapter discussed the calculation of maxima. More specifically it analyzes a new heuristic, the Move-To-Front Algorithm, recently developed by Bentley, Clarkson and Levine. We prove mathematically that the Move-To-Front Algorithm is extremely efficient; on average it performs only one comparison per input point except on those in an asymptotically negligible subset." @default.
- W86959611 created "2016-06-24" @default.
- W86959611 creator A5051953152 @default.
- W86959611 date "1990-01-01" @default.
- W86959611 modified "2023-09-27" @default.
- W86959611 title "Probabilistic analysis of geometric algorithms" @default.
- W86959611 hasPublicationYear "1990" @default.
- W86959611 type Work @default.
- W86959611 sameAs 86959611 @default.
- W86959611 citedByCount "1" @default.
- W86959611 crossrefType "journal-article" @default.
- W86959611 hasAuthorship W86959611A5051953152 @default.
- W86959611 hasConcept C105795698 @default.
- W86959611 hasConcept C108094655 @default.
- W86959611 hasConcept C111110010 @default.
- W86959611 hasConcept C111472728 @default.
- W86959611 hasConcept C111696304 @default.
- W86959611 hasConcept C112680207 @default.
- W86959611 hasConcept C11413529 @default.
- W86959611 hasConcept C114614502 @default.
- W86959611 hasConcept C135692309 @default.
- W86959611 hasConcept C138885662 @default.
- W86959611 hasConcept C157972887 @default.
- W86959611 hasConcept C198352243 @default.
- W86959611 hasConcept C206194317 @default.
- W86959611 hasConcept C24404364 @default.
- W86959611 hasConcept C2524010 @default.
- W86959611 hasConcept C2778937211 @default.
- W86959611 hasConcept C2780586882 @default.
- W86959611 hasConcept C29123130 @default.
- W86959611 hasConcept C33923547 @default.
- W86959611 hasConcept C39132409 @default.
- W86959611 hasConcept C41008148 @default.
- W86959611 hasConcept C49937458 @default.
- W86959611 hasConcept C50820777 @default.
- W86959611 hasConcept C71559656 @default.
- W86959611 hasConcept C7356347 @default.
- W86959611 hasConceptScore W86959611C105795698 @default.
- W86959611 hasConceptScore W86959611C108094655 @default.
- W86959611 hasConceptScore W86959611C111110010 @default.
- W86959611 hasConceptScore W86959611C111472728 @default.
- W86959611 hasConceptScore W86959611C111696304 @default.
- W86959611 hasConceptScore W86959611C112680207 @default.
- W86959611 hasConceptScore W86959611C11413529 @default.
- W86959611 hasConceptScore W86959611C114614502 @default.
- W86959611 hasConceptScore W86959611C135692309 @default.
- W86959611 hasConceptScore W86959611C138885662 @default.
- W86959611 hasConceptScore W86959611C157972887 @default.
- W86959611 hasConceptScore W86959611C198352243 @default.
- W86959611 hasConceptScore W86959611C206194317 @default.
- W86959611 hasConceptScore W86959611C24404364 @default.
- W86959611 hasConceptScore W86959611C2524010 @default.
- W86959611 hasConceptScore W86959611C2778937211 @default.
- W86959611 hasConceptScore W86959611C2780586882 @default.
- W86959611 hasConceptScore W86959611C29123130 @default.
- W86959611 hasConceptScore W86959611C33923547 @default.
- W86959611 hasConceptScore W86959611C39132409 @default.
- W86959611 hasConceptScore W86959611C41008148 @default.
- W86959611 hasConceptScore W86959611C49937458 @default.
- W86959611 hasConceptScore W86959611C50820777 @default.
- W86959611 hasConceptScore W86959611C71559656 @default.
- W86959611 hasConceptScore W86959611C7356347 @default.
- W86959611 hasLocation W869596111 @default.
- W86959611 hasOpenAccess W86959611 @default.
- W86959611 hasPrimaryLocation W869596111 @default.
- W86959611 hasRelatedWork W1501703293 @default.
- W86959611 hasRelatedWork W1560502031 @default.
- W86959611 hasRelatedWork W1589450195 @default.
- W86959611 hasRelatedWork W1669955554 @default.
- W86959611 hasRelatedWork W1967443570 @default.
- W86959611 hasRelatedWork W1991462609 @default.
- W86959611 hasRelatedWork W2010685496 @default.
- W86959611 hasRelatedWork W2013218978 @default.
- W86959611 hasRelatedWork W2031165919 @default.
- W86959611 hasRelatedWork W2067631433 @default.
- W86959611 hasRelatedWork W2070224451 @default.
- W86959611 hasRelatedWork W2095921276 @default.
- W86959611 hasRelatedWork W2141074036 @default.
- W86959611 hasRelatedWork W2157071004 @default.
- W86959611 hasRelatedWork W2163422126 @default.
- W86959611 hasRelatedWork W2223620343 @default.
- W86959611 hasRelatedWork W2506792106 @default.
- W86959611 hasRelatedWork W255996094 @default.
- W86959611 hasRelatedWork W1519368613 @default.
- W86959611 isParatext "false" @default.
- W86959611 isRetracted "false" @default.
- W86959611 magId "86959611" @default.
- W86959611 workType "article" @default.