Testing homotopy for paths in the plane
From MaRDI portal
Publication:1424318
DOI10.1007/s00454-003-2949-yzbMath1060.68127DBLPjournals/dcg/CabelloLMS04OpenAlexW2056203932WikidataQ56970597 ScholiaQ56970597MaRDI QIDQ1424318
Yuanxin Liu, Sergio Cabello, Andrea Mantler, Jack Scott Snoeyink
Publication date: 11 March 2004
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-003-2949-y
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (11)
Median trajectories ⋮ Homotopic \(\mathcal{C}\)-oriented routing with few links and thick edges ⋮ Computing homotopic shortest paths efficiently ⋮ Testing graph isotopy on surfaces ⋮ APPROXIMATE SHORTEST HOMOTOPIC PATHS IN WEIGHTED REGIONS ⋮ Computing homotopic line simplification ⋮ Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees ⋮ Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time ⋮ DRAWING WITH FAT EDGES ⋮ A Census of Plane Graphs with Polyline Edges ⋮ Minimum Cell Connection in Line Segment Arrangements
This page was built for publication: Testing homotopy for paths in the plane
