Minimizing the total absolute Gaussian curvature in a terrain is hard

Proceedings of the 17th Canadian Conference on Computational Geometry, CCCG 2005

Volumn , Issue , 2005, Pages 195-198

  Buchin, Maike ^a   Giesen, Joachim ^b  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

LANDFORMS;

GAUSSIAN CURVATURES; NP-HARD; VERTEX SET;

COMPUTATIONAL GEOMETRY;

EID: 84928116698     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. L. Alboul and R. van Damme. Polyhedral metrics in surface reconstruction: Tight triangulations. In T. Goodman and R. Martin, editors, The Mathematics of Surfaces VII, pages 309 336. Clarendon Press, Oxford, 1997.
2. T. de Kok, M. van Kreveld, and M. Loffler. Minimizing local minima in terrains with higher-order Delaunay triangulations. In Proc. 21st European Workshop on Computational Geometry, 2005.
3. P. Gelir. Reconstructing surfaces that exhibit sharp features. Master's thesis, ETH Zurich, 2003.
4. J. Kratochvil and J. Nesetril. Independent set and clique problems in intersection-defined classes of graphs. Comment. Math. Univ. Carolinae, 31:85 93, 1990.
5. W. Kiihnel. Total absolute curvature of polyhedral manifolds with boundary in E. Geom. Ded., 8(1):1 12, 1979.