Computing large planar regions in terrains, with an application to fracture surfaces

DOI10.1016/j.dam.2002.11.004zbMath1076.68105OpenAlexW1983862473MaRDI QIDQ1827827

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

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2002.11.004

zbMATH Keywords

Computational geometryOptimizationPlanar regionTerrain

Mathematics Subject Classification ID

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

Related Items (1)

FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE

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
• Unnamed Item

This page was built for publication: Computing large planar regions in terrains, with an application to fracture surfaces