TOPOLOGICAL PEELING AND APPLICATIONS

DOI10.1142/S0218195903001104MaRDI QIDQ4818578zbMATH OpenFDO

Authors Danny Z. Chen, Shuang Luan, 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) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• scientific article; zbMATH DE number 2081012
• An Experimental Study and Comparison of Topological Peeling and Topological Walk
• Topologically sweeping an arrangement
• WALKING IN AN ARRANGEMENT TOPOLOGICALLY
• A topology construction from line drawings using a uniform plane subdivision technique.

Cites work

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

Cited in

(4)

• An Experimental Study and Comparison of Topological Peeling and Topological Walk
• WALKING IN AN ARRANGEMENT TOPOLOGICALLY
• Topological sweep of the complete graph
• scientific article; zbMATH DE number 2081012 (Why is no real title available?)

This page was built for publication: TOPOLOGICAL PEELING AND APPLICATIONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818578)