Shortest curves in planar regions with curved boundary

DOI10.1016/0304-3975(93)90019-PzbMath0787.68099MaRDI QIDQ1210291

Richard D. Bourgin, Sally E. Howe

Publication date: 24 May 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

shortest pathtime complexitycomputational geometrycurved boundarysimple plane polygons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Shortest paths in simply connected regions in \({\mathbb{R}}^ 2\)

Cites Work

• Shortest paths in simply connected regions in \({\mathbb{R}}^ 2\)
• Computational geometry in a curved world
• Decomposition and intersection of simple splinegons
• Triangulating a simple polygon in linear time
• Detecting the intersection of convex objects in the plane
• Euclidean shortest paths in the presence of rectilinear barriers
• Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item