Computing Large Planar Regions in Terrains

DOI10.1016/S1571-0661(04)80982-4zbMath1260.68431OpenAlexW1968040129MaRDI QIDQ4917094

Rahul Ray, Ulrich Wendt, Michiel H. M. Smid, Katharina Lange

Publication date: 26 April 2013

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

Full work available at URL: https://doi.org/10.1016/s1571-0661(04)80982-4

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• LEDA

Cites Work

• On a circle placement problem
• On a class of \(O(n^ 2)\) problems in computational geometry
• Near-optimal fully-dynamic graph connectivity
• Surface Approximation and Geometric Partitions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing Large Planar Regions in Terrains