Matches in SemOpenAlex for { <https://semopenalex.org/work/W2223620343> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W2223620343 abstract "This thesis consists of two parts unified under the common theme that both of them are concerned with the complexity of geometric problems. The first part of this thesis initiates a study of sublinear algorithms for geometric problems in two and three dimensions when no preprocessing is allowed. The problems we consider include intersection detection of convex polygons and polyhedra, point location in two-dimensional Voronoi diagrams and triangulations, ray shooting towards convex polyhedra, and nearest neighbor type problems. Our (randomized) algorithms read only a small fraction of the input. Unlike their predecessors, our algorithms never err and randomization only affects the running time but not the correctness of the output. For each problem considered (with input size n), we achieve expected running time of O( n ), which we show to be optimal. We also approximate, for any fixed e > 0, the volume of a n-vertex convex polytope and the length of the shortest path between two points on its boundary, to within a relative factor of 1 + e and in expected time O( n ). In the second part of this thesis, we prove strong lower bounds for geometric problems in standard models of computation. We prove several near-optimal lower bounds for intersection searching problems in two and three dimensions in the pointer machine model. Our lower bounds resolve a couple of long-standing open problems in computational geometry. We show that: (1) The two-dimensional generalization of fractional cascading is impossible; (2) There exists a n-vertex convex polytope that admits of no boundary dominant Dobkin-Kirkpatrick hierarchy, for any n large enough. We also prove a near-optimal deterministic query time lower bound for Approximate Nearest Neighbor Searching—a basic problem in computational geometry with a variety of applications—in the cell probe model. This lower bound holds in a very special space (the Hamming Cube) and for a very loose approximation factor." @default.
- W2223620343 created "2016-06-24" @default.
- W2223620343 creator A5044565966 @default.
- W2223620343 creator A5086939495 @default.
- W2223620343 date "2005-01-01" @default.
- W2223620343 modified "2023-09-26" @default.
- W2223620343 title "Sublinear geometric algorithms and geometric lower bounds" @default.
- W2223620343 hasPublicationYear "2005" @default.
- W2223620343 type Work @default.
- W2223620343 sameAs 2223620343 @default.
- W2223620343 citedByCount "0" @default.
- W2223620343 crossrefType "journal-article" @default.
- W2223620343 hasAuthorship W2223620343A5044565966 @default.
- W2223620343 hasAuthorship W2223620343A5086939495 @default.
- W2223620343 hasConcept C110943637 @default.
- W2223620343 hasConcept C112680207 @default.
- W2223620343 hasConcept C11413529 @default.
- W2223620343 hasConcept C114614502 @default.
- W2223620343 hasConcept C118615104 @default.
- W2223620343 hasConcept C132525143 @default.
- W2223620343 hasConcept C134306372 @default.
- W2223620343 hasConcept C145691206 @default.
- W2223620343 hasConcept C157972887 @default.
- W2223620343 hasConcept C2524010 @default.
- W2223620343 hasConcept C2780034980 @default.
- W2223620343 hasConcept C29123130 @default.
- W2223620343 hasConcept C33923547 @default.
- W2223620343 hasConcept C49870271 @default.
- W2223620343 hasConcept C54829058 @default.
- W2223620343 hasConcept C77553402 @default.
- W2223620343 hasConcept C80899671 @default.
- W2223620343 hasConceptScore W2223620343C110943637 @default.
- W2223620343 hasConceptScore W2223620343C112680207 @default.
- W2223620343 hasConceptScore W2223620343C11413529 @default.
- W2223620343 hasConceptScore W2223620343C114614502 @default.
- W2223620343 hasConceptScore W2223620343C118615104 @default.
- W2223620343 hasConceptScore W2223620343C132525143 @default.
- W2223620343 hasConceptScore W2223620343C134306372 @default.
- W2223620343 hasConceptScore W2223620343C145691206 @default.
- W2223620343 hasConceptScore W2223620343C157972887 @default.
- W2223620343 hasConceptScore W2223620343C2524010 @default.
- W2223620343 hasConceptScore W2223620343C2780034980 @default.
- W2223620343 hasConceptScore W2223620343C29123130 @default.
- W2223620343 hasConceptScore W2223620343C33923547 @default.
- W2223620343 hasConceptScore W2223620343C49870271 @default.
- W2223620343 hasConceptScore W2223620343C54829058 @default.
- W2223620343 hasConceptScore W2223620343C77553402 @default.
- W2223620343 hasConceptScore W2223620343C80899671 @default.
- W2223620343 hasLocation W22236203431 @default.
- W2223620343 hasOpenAccess W2223620343 @default.
- W2223620343 hasPrimaryLocation W22236203431 @default.
- W2223620343 hasRelatedWork W1589450195 @default.
- W2223620343 hasRelatedWork W175182882 @default.
- W2223620343 hasRelatedWork W1967390064 @default.
- W2223620343 hasRelatedWork W1967443570 @default.
- W2223620343 hasRelatedWork W1975536873 @default.
- W2223620343 hasRelatedWork W1993188092 @default.
- W2223620343 hasRelatedWork W2095921276 @default.
- W2223620343 hasRelatedWork W2100227891 @default.
- W2223620343 hasRelatedWork W2137885048 @default.
- W2223620343 hasRelatedWork W2157795846 @default.
- W2223620343 hasRelatedWork W2182098184 @default.
- W2223620343 hasRelatedWork W2202493075 @default.
- W2223620343 hasRelatedWork W2468158418 @default.
- W2223620343 hasRelatedWork W267188008 @default.
- W2223620343 hasRelatedWork W2744506364 @default.
- W2223620343 hasRelatedWork W2798937599 @default.
- W2223620343 hasRelatedWork W2950878015 @default.
- W2223620343 hasRelatedWork W3200681452 @default.
- W2223620343 hasRelatedWork W3203304100 @default.
- W2223620343 hasRelatedWork W1529008783 @default.
- W2223620343 isParatext "false" @default.
- W2223620343 isRetracted "false" @default.
- W2223620343 magId "2223620343" @default.
- W2223620343 workType "article" @default.