WALKING IN AN ARRANGEMENT TOPOLOGICALLY

DOI10.1142/S0218195994000094zbMATH Open0820.68121OpenAlexW2096155343MaRDI QIDQ4312275FDOQ4312275

Authors: Takeshi Tokuyama, Tetsuo Asano, Leonidas Guibas 

Publication date: 6 November 1994

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

Full work available at URL: https://doi.org/10.1142/s0218195994000094

Recommendations

• Taking a walk in a planar arrangement
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Topologically sweeping an arrangement
• TOPOLOGICAL PEELING AND APPLICATIONS
• scientific article; zbMATH DE number 2081012

zbMATH Keywords

computational geometryplane sweeptopological walk

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (11)

• TOPOLOGICAL PEELING AND APPLICATIONS
• Taking a walk in a planar arrangement
• An Experimental Study and Comparison of Topological Peeling and Topological Walk
• Algorithms for projecting points to give the most uniform distribution with applications to hashing
• A unified scheme for detecting fundamental curves in binary edge images
• Topologically sweeping an arrangement
• WALKING IN A TRIANGULATION
• Topological sweep of the complete graph
• MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
• Title not available (Why is that?)
• Efficient algorithms for determining 3D biplane imaging geometry

This page was built for publication: WALKING IN AN ARRANGEMENT TOPOLOGICALLY

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