Matches in SemOpenAlex for { <https://semopenalex.org/work/W2133520610> ?p ?o ?g. }
Showing items 1 to 55 of
55
with 100 items per page.
- W2133520610 abstract "We reexamine fundamental problems from computational geometry in theallword RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm for offline point location, a two-dimensional analog of sorting where one needs to order points with respect to segments. This result implies, for example, that the Voronoi diagram of n points in the plane can be constructed in (randomized) time n· 2O(√ lg lg n). Similar bounds hold for numerous other geometric problems, such as three-dimensional convex hulls, planar Euclidean minimum spanning trees, line segment intersection, and triangulation of non-simple polygons.In FOCS'06, we developed a data structure for online point location, which implied a bound of O(n (lg n)/(lg lg n) for Voronoi diagrams and the other problems. Our current bounds are dramatically better, and a convincing improvement over the classic O(n lg n) algorithms. As in the field of integer sorting, the main challenge is to find ways to manipulate information, while avoiding the online problem (in that case, predecessor search)." @default.
- W2133520610 created "2016-06-24" @default.
- W2133520610 creator A5031221610 @default.
- W2133520610 creator A5032955418 @default.
- W2133520610 date "2007-06-11" @default.
- W2133520610 modified "2023-10-18" @default.
- W2133520610 title "Voronoi diagrams in n · 2o(√lg lg n) time" @default.
- W2133520610 cites W1974844978 @default.
- W2133520610 cites W1978715699 @default.
- W2133520610 cites W1984816083 @default.
- W2133520610 cites W1985361644 @default.
- W2133520610 cites W1986633843 @default.
- W2133520610 cites W2024305877 @default.
- W2133520610 cites W2038142281 @default.
- W2133520610 cites W2068141203 @default.
- W2133520610 cites W2080845014 @default.
- W2133520610 cites W2095206322 @default.
- W2133520610 cites W4300640952 @default.
- W2133520610 doi "https://doi.org/10.1145/1250790.1250796" @default.
- W2133520610 hasPublicationYear "2007" @default.
- W2133520610 type Work @default.
- W2133520610 sameAs 2133520610 @default.
- W2133520610 citedByCount "6" @default.
- W2133520610 crossrefType "proceedings-article" @default.
- W2133520610 hasAuthorship W2133520610A5031221610 @default.
- W2133520610 hasAuthorship W2133520610A5032955418 @default.
- W2133520610 hasConcept C114614502 @default.
- W2133520610 hasConcept C121332964 @default.
- W2133520610 hasConcept C24881265 @default.
- W2133520610 hasConcept C2524010 @default.
- W2133520610 hasConcept C33923547 @default.
- W2133520610 hasConcept C41008148 @default.
- W2133520610 hasConceptScore W2133520610C114614502 @default.
- W2133520610 hasConceptScore W2133520610C121332964 @default.
- W2133520610 hasConceptScore W2133520610C24881265 @default.
- W2133520610 hasConceptScore W2133520610C2524010 @default.
- W2133520610 hasConceptScore W2133520610C33923547 @default.
- W2133520610 hasConceptScore W2133520610C41008148 @default.
- W2133520610 hasLocation W21335206101 @default.
- W2133520610 hasOpenAccess W2133520610 @default.
- W2133520610 hasPrimaryLocation W21335206101 @default.
- W2133520610 hasRelatedWork W1974502808 @default.
- W2133520610 hasRelatedWork W1978042415 @default.
- W2133520610 hasRelatedWork W2017331178 @default.
- W2133520610 hasRelatedWork W2097522224 @default.
- W2133520610 hasRelatedWork W2120080672 @default.
- W2133520610 hasRelatedWork W2976797620 @default.
- W2133520610 hasRelatedWork W3086542228 @default.
- W2133520610 hasRelatedWork W3092815978 @default.
- W2133520610 hasRelatedWork W3153743757 @default.
- W2133520610 hasRelatedWork W4200431641 @default.
- W2133520610 isParatext "false" @default.
- W2133520610 isRetracted "false" @default.
- W2133520610 magId "2133520610" @default.
- W2133520610 workType "article" @default.