TOPOLOGICAL PEELING AND APPLICATIONS

DOI10.1142/S0218195903001104zbMath1101.68899MaRDI QIDQ4818578

Shuang Luan, Danny Z. Chen, Jinhui Xu

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

shortest patharrangementspace efficient algorithmstopological walk

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Topological sweep of the complete graph

Cites Work

• The power of geometric duality
• Topologically sweeping an arrangement
• Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
• On minimum-area hulls
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Plane-sweep algorithms for intersecting geometric figures
• WALKING IN AN ARRANGEMENT TOPOLOGICALLY
• Constructing Belts in Two-Dimensional Arrangements with Applications
• Sorting jordan sequences in linear time using level-linked search trees