FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4328099883> ?p ?o ?g. }

• W4328099883 endingPage "62" @default.
• W4328099883 startingPage "1" @default.
• W4328099883 abstract "Given a set of pairwise disjoint polygonal obstacles in the plane, finding an obstacle-avoiding Euclidean shortest path between two points is a classical problem in computational geometry and has been studied extensively. Previously, Hershberger and Suri (in SIAM Journal on Computing , 1999) gave an algorithm of O(n log n ) time and O(n log n ) space, where n is the total number of vertices of all obstacles. Recently, by modifying Hershberger and Suri’s algorithm, Wang (in SODA’21) reduced the space to O(n) while the runtime of the algorithm is still O(n log n ). In this article, we present a new algorithm of O(n+h log h ) time and O(n) space, provided that a triangulation of the free space is given, where h is the number of obstacles. The algorithm is better than the previous work when h is relatively small. Our algorithm builds a shortest path map for a source point s so that given any query point t , the shortest path length from s to t can be computed in O (log n ) time and a shortest s - t path can be produced in additional time linear in the number of edges of the path." @default.
• W4328099883 created "2023-03-22" @default.
• W4328099883 creator A5048766627 @default.
• W4328099883 date "2023-03-21" @default.
• W4328099883 modified "2023-09-27" @default.
• W4328099883 title "A New Algorithm for Euclidean Shortest Paths in the Plane" @default.
• W4328099883 cites W1482503584 @default.
• W4328099883 cites W1497730917 @default.
• W4328099883 cites W1983422667 @default.
• W4328099883 cites W1985010089 @default.
• W4328099883 cites W1992176147 @default.
• W4328099883 cites W1992320342 @default.
• W4328099883 cites W2003711654 @default.
• W4328099883 cites W2004884735 @default.
• W4328099883 cites W2011297770 @default.
• W4328099883 cites W2016584965 @default.
• W4328099883 cites W2029668981 @default.
• W4328099883 cites W2032159439 @default.
• W4328099883 cites W2035612683 @default.
• W4328099883 cites W2038699153 @default.
• W4328099883 cites W2043598638 @default.
• W4328099883 cites W2058510050 @default.
• W4328099883 cites W2063372577 @default.
• W4328099883 cites W2063460978 @default.
• W4328099883 cites W2081751185 @default.
• W4328099883 cites W2081777693 @default.
• W4328099883 cites W2088397521 @default.
• W4328099883 cites W2126876121 @default.
• W4328099883 cites W2128830892 @default.
• W4328099883 cites W2130647774 @default.
• W4328099883 cites W2132026455 @default.
• W4328099883 cites W2132339863 @default.
• W4328099883 cites W2132445073 @default.
• W4328099883 cites W2150861432 @default.
• W4328099883 cites W2165366584 @default.
• W4328099883 cites W2167427782 @default.
• W4328099883 cites W2171580054 @default.
• W4328099883 cites W2891382868 @default.
• W4328099883 cites W2952603777 @default.
• W4328099883 cites W2963551506 @default.
• W4328099883 cites W4250008887 @default.
• W4328099883 doi "https://doi.org/10.1145/3580475" @default.
• W4328099883 hasPublicationYear "2023" @default.
• W4328099883 type Work @default.
• W4328099883 citedByCount "0" @default.
• W4328099883 crossrefType "journal-article" @default.
• W4328099883 hasAuthorship W4328099883A5048766627 @default.
• W4328099883 hasBestOaLocation W43280998831 @default.
• W4328099883 hasConcept C11413529 @default.
• W4328099883 hasConcept C114614502 @default.
• W4328099883 hasConcept C118615104 @default.
• W4328099883 hasConcept C119971455 @default.
• W4328099883 hasConcept C132525143 @default.
• W4328099883 hasConcept C168451585 @default.
• W4328099883 hasConcept C170836113 @default.
• W4328099883 hasConcept C173870130 @default.
• W4328099883 hasConcept C199360897 @default.
• W4328099883 hasConcept C22590252 @default.
• W4328099883 hasConcept C2777735758 @default.
• W4328099883 hasConcept C33923547 @default.
• W4328099883 hasConcept C41008148 @default.
• W4328099883 hasConcept C45340560 @default.
• W4328099883 hasConcept C63553672 @default.
• W4328099883 hasConcept C70266271 @default.
• W4328099883 hasConceptScore W4328099883C11413529 @default.
• W4328099883 hasConceptScore W4328099883C114614502 @default.
• W4328099883 hasConceptScore W4328099883C118615104 @default.
• W4328099883 hasConceptScore W4328099883C119971455 @default.
• W4328099883 hasConceptScore W4328099883C132525143 @default.
• W4328099883 hasConceptScore W4328099883C168451585 @default.
• W4328099883 hasConceptScore W4328099883C170836113 @default.
• W4328099883 hasConceptScore W4328099883C173870130 @default.
• W4328099883 hasConceptScore W4328099883C199360897 @default.
• W4328099883 hasConceptScore W4328099883C22590252 @default.
• W4328099883 hasConceptScore W4328099883C2777735758 @default.
• W4328099883 hasConceptScore W4328099883C33923547 @default.
• W4328099883 hasConceptScore W4328099883C41008148 @default.
• W4328099883 hasConceptScore W4328099883C45340560 @default.
• W4328099883 hasConceptScore W4328099883C63553672 @default.
• W4328099883 hasConceptScore W4328099883C70266271 @default.
• W4328099883 hasIssue "2" @default.
• W4328099883 hasLocation W43280998831 @default.
• W4328099883 hasLocation W43280998832 @default.
• W4328099883 hasOpenAccess W4328099883 @default.
• W4328099883 hasPrimaryLocation W43280998831 @default.
• W4328099883 hasRelatedWork W1974495461 @default.
• W4328099883 hasRelatedWork W2001902288 @default.
• W4328099883 hasRelatedWork W2378193903 @default.
• W4328099883 hasRelatedWork W2384965074 @default.
• W4328099883 hasRelatedWork W2403030781 @default.
• W4328099883 hasRelatedWork W2462581792 @default.
• W4328099883 hasRelatedWork W2810620529 @default.
• W4328099883 hasRelatedWork W3183360588 @default.
• W4328099883 hasRelatedWork W4321491762 @default.
• W4328099883 hasRelatedWork W4328099883 @default.
• W4328099883 hasVolume "70" @default.
• W4328099883 isParatext "false" @default.
• W4328099883 isRetracted "false" @default.

• next