WALKING IN AN ARRANGEMENT TOPOLOGICALLY

DOI10.1142/S0218195994000094zbMath0820.68121OpenAlexW2096155343MaRDI QIDQ4312275

Takeshi Tokuyama, Leonidas J. Guibas, Tetsuo Asano

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

zbMATH Keywords

computational geometryplane sweeptopological walk

Mathematics Subject Classification ID

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

Related Items

Algorithms for projecting points to give the most uniform distribution with applications to hashing ⋮ TOPOLOGICAL PEELING AND APPLICATIONS ⋮ A unified scheme for detecting fundamental curves in binary edge images ⋮ Topological sweep of the complete graph ⋮ MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS ⋮ Efficient algorithms for determining 3D biplane imaging geometry