Matches in SemOpenAlex for { <https://semopenalex.org/work/W2034144081> ?p ?o ?g. }
Showing items 1 to 66 of
66
with 100 items per page.
- W2034144081 endingPage "60" @default.
- W2034144081 startingPage "55" @default.
- W2034144081 abstract "Abstract Given a sequence of n points that form the vertices of a simple polygon, we show that determining a closest pair requires Ω(n log n) time in the algebraic decision tree model. Together with the well-known O(n log n) upper bound for finding a closest pair, this settles an open problem of Lee and Preparata. We also extend this O(n log n) upper bound to the following problem: Given a collection of sets with a total of n points in the plane, find for each point a closest neighbor that does not belong to the same set." @default.
- W2034144081 created "2016-06-24" @default.
- W2034144081 creator A5034238598 @default.
- W2034144081 creator A5069999967 @default.
- W2034144081 creator A5078491738 @default.
- W2034144081 creator A5079453326 @default.
- W2034144081 date "1992-04-01" @default.
- W2034144081 modified "2023-09-27" @default.
- W2034144081 title "Optimal time bounds for some proximity problems in the plane" @default.
- W2034144081 cites W1564157412 @default.
- W2034144081 cites W1964869106 @default.
- W2034144081 cites W1981233261 @default.
- W2034144081 cites W2004988621 @default.
- W2034144081 cites W2035300538 @default.
- W2034144081 cites W2055257826 @default.
- W2034144081 cites W2056531186 @default.
- W2034144081 cites W2136277034 @default.
- W2034144081 doi "https://doi.org/10.1016/0020-0190(92)90133-g" @default.
- W2034144081 hasPublicationYear "1992" @default.
- W2034144081 type Work @default.
- W2034144081 sameAs 2034144081 @default.
- W2034144081 citedByCount "19" @default.
- W2034144081 countsByYear W20341440812013 @default.
- W2034144081 countsByYear W20341440812014 @default.
- W2034144081 countsByYear W20341440812016 @default.
- W2034144081 countsByYear W20341440812017 @default.
- W2034144081 crossrefType "journal-article" @default.
- W2034144081 hasAuthorship W2034144081A5034238598 @default.
- W2034144081 hasAuthorship W2034144081A5069999967 @default.
- W2034144081 hasAuthorship W2034144081A5078491738 @default.
- W2034144081 hasAuthorship W2034144081A5079453326 @default.
- W2034144081 hasConcept C11413529 @default.
- W2034144081 hasConcept C126255220 @default.
- W2034144081 hasConcept C17825722 @default.
- W2034144081 hasConcept C2524010 @default.
- W2034144081 hasConcept C311688 @default.
- W2034144081 hasConcept C33923547 @default.
- W2034144081 hasConcept C41008148 @default.
- W2034144081 hasConceptScore W2034144081C11413529 @default.
- W2034144081 hasConceptScore W2034144081C126255220 @default.
- W2034144081 hasConceptScore W2034144081C17825722 @default.
- W2034144081 hasConceptScore W2034144081C2524010 @default.
- W2034144081 hasConceptScore W2034144081C311688 @default.
- W2034144081 hasConceptScore W2034144081C33923547 @default.
- W2034144081 hasConceptScore W2034144081C41008148 @default.
- W2034144081 hasIssue "1" @default.
- W2034144081 hasLocation W20341440811 @default.
- W2034144081 hasOpenAccess W2034144081 @default.
- W2034144081 hasPrimaryLocation W20341440811 @default.
- W2034144081 hasRelatedWork W1535372252 @default.
- W2034144081 hasRelatedWork W1567905937 @default.
- W2034144081 hasRelatedWork W2023536788 @default.
- W2034144081 hasRelatedWork W2333698505 @default.
- W2034144081 hasRelatedWork W2351491280 @default.
- W2034144081 hasRelatedWork W2371447506 @default.
- W2034144081 hasRelatedWork W2386767533 @default.
- W2034144081 hasRelatedWork W2497463627 @default.
- W2034144081 hasRelatedWork W3002994429 @default.
- W2034144081 hasRelatedWork W303980170 @default.
- W2034144081 hasVolume "42" @default.
- W2034144081 isParatext "false" @default.
- W2034144081 isRetracted "false" @default.
- W2034144081 magId "2034144081" @default.
- W2034144081 workType "article" @default.