Matches in SemOpenAlex for { <https://semopenalex.org/work/W2762701907> ?p ?o ?g. }
- W2762701907 endingPage "3829" @default.
- W2762701907 startingPage "3814" @default.
- W2762701907 abstract "We provide linear-time algorithms for geometric graphs with sublinearly many edge crossings. That is, we provide algorithms running in $O(n)$ time on connected geometric graphs having n vertices and k pairwise crossings, where k is smaller than n by an iterated logarithmic factor. Specific problems that we study include Voronoi diagrams and single-source shortest paths. Our algorithms all run in linear time in the standard comparison-based computational model; hence, we make no assumptions about the distribution or bit complexities of edge weights, nor do we utilize unusual bit-level operations on memory words. Instead, our algorithms are based on a planarization method that “zeros in” on edge crossings, together with methods for applying planar separator decompositions to geometric graphs with sublinearly many crossings. Incidentally, our planarization algorithm also solves an open computational geometry problem of Chazelle for triangulating a self-intersecting polygonal chain having n segments and k crossings in linear time, for the case when k is sublinear in n by an iterated logarithmic factor." @default.
- W2762701907 created "2017-10-20" @default.
- W2762701907 creator A5034971300 @default.
- W2762701907 creator A5048574995 @default.
- W2762701907 creator A5066225806 @default.
- W2762701907 date "2010-01-01" @default.
- W2762701907 modified "2023-09-25" @default.
- W2762701907 title "Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings" @default.
- W2762701907 cites W1552413686 @default.
- W2762701907 cites W1874694348 @default.
- W2762701907 cites W1964869106 @default.
- W2762701907 cites W1967005434 @default.
- W2762701907 cites W1968215127 @default.
- W2762701907 cites W1968647828 @default.
- W2762701907 cites W1990317614 @default.
- W2762701907 cites W1997631839 @default.
- W2762701907 cites W1999545213 @default.
- W2762701907 cites W2000879295 @default.
- W2762701907 cites W2015696135 @default.
- W2762701907 cites W2019814699 @default.
- W2762701907 cites W2029814178 @default.
- W2762701907 cites W2032841680 @default.
- W2762701907 cites W2038176627 @default.
- W2762701907 cites W2038643780 @default.
- W2762701907 cites W2049413646 @default.
- W2762701907 cites W2060113403 @default.
- W2762701907 cites W2062277720 @default.
- W2762701907 cites W2068019092 @default.
- W2762701907 cites W2077383738 @default.
- W2762701907 cites W2083669067 @default.
- W2762701907 cites W2084224084 @default.
- W2762701907 cites W2085761844 @default.
- W2762701907 cites W2100586428 @default.
- W2762701907 cites W2106114602 @default.
- W2762701907 cites W2106413026 @default.
- W2762701907 cites W2118169763 @default.
- W2762701907 cites W2128865241 @default.
- W2762701907 cites W2138304862 @default.
- W2762701907 cites W2144713886 @default.
- W2762701907 cites W2150861432 @default.
- W2762701907 cites W2166542580 @default.
- W2762701907 cites W2762051376 @default.
- W2762701907 cites W2762935521 @default.
- W2762701907 cites W4248634500 @default.
- W2762701907 cites W4254977685 @default.
- W2762701907 doi "https://doi.org/10.1137/090759112" @default.
- W2762701907 hasPublicationYear "2010" @default.
- W2762701907 type Work @default.
- W2762701907 sameAs 2762701907 @default.
- W2762701907 citedByCount "7" @default.
- W2762701907 countsByYear W27627019072013 @default.
- W2762701907 countsByYear W27627019072017 @default.
- W2762701907 countsByYear W27627019072018 @default.
- W2762701907 countsByYear W27627019072020 @default.
- W2762701907 countsByYear W27627019072021 @default.
- W2762701907 countsByYear W27627019072022 @default.
- W2762701907 crossrefType "journal-article" @default.
- W2762701907 hasAuthorship W2762701907A5034971300 @default.
- W2762701907 hasAuthorship W2762701907A5048574995 @default.
- W2762701907 hasAuthorship W2762701907A5066225806 @default.
- W2762701907 hasBestOaLocation W27627019072 @default.
- W2762701907 hasConcept C112680207 @default.
- W2762701907 hasConcept C11413529 @default.
- W2762701907 hasConcept C114614502 @default.
- W2762701907 hasConcept C117160843 @default.
- W2762701907 hasConcept C118615104 @default.
- W2762701907 hasConcept C134306372 @default.
- W2762701907 hasConcept C140479938 @default.
- W2762701907 hasConcept C182860218 @default.
- W2762701907 hasConcept C24881265 @default.
- W2762701907 hasConcept C2524010 @default.
- W2762701907 hasConcept C29123130 @default.
- W2762701907 hasConcept C311688 @default.
- W2762701907 hasConcept C33923547 @default.
- W2762701907 hasConcept C39927690 @default.
- W2762701907 hasConcept C49777392 @default.
- W2762701907 hasConcept C88230418 @default.
- W2762701907 hasConceptScore W2762701907C112680207 @default.
- W2762701907 hasConceptScore W2762701907C11413529 @default.
- W2762701907 hasConceptScore W2762701907C114614502 @default.
- W2762701907 hasConceptScore W2762701907C117160843 @default.
- W2762701907 hasConceptScore W2762701907C118615104 @default.
- W2762701907 hasConceptScore W2762701907C134306372 @default.
- W2762701907 hasConceptScore W2762701907C140479938 @default.
- W2762701907 hasConceptScore W2762701907C182860218 @default.
- W2762701907 hasConceptScore W2762701907C24881265 @default.
- W2762701907 hasConceptScore W2762701907C2524010 @default.
- W2762701907 hasConceptScore W2762701907C29123130 @default.
- W2762701907 hasConceptScore W2762701907C311688 @default.
- W2762701907 hasConceptScore W2762701907C33923547 @default.
- W2762701907 hasConceptScore W2762701907C39927690 @default.
- W2762701907 hasConceptScore W2762701907C49777392 @default.
- W2762701907 hasConceptScore W2762701907C88230418 @default.
- W2762701907 hasIssue "8" @default.
- W2762701907 hasLocation W27627019071 @default.
- W2762701907 hasLocation W27627019072 @default.
- W2762701907 hasOpenAccess W2762701907 @default.
- W2762701907 hasPrimaryLocation W27627019071 @default.