Abstract
We present a method for extracting feature curves called crest lines from a triangulated surface. Then, we calculate the geodesic Voronoi diagram of crest lines to segment the surface into several regions. Afterward, barycentric surface flattening using theory from graph embeddings is implemented and, using the Geodesic Voronoi diagram, we develop a faster surface flattening algorithm.
Original language | English (US) |
---|---|
Pages (from-to) | 536-544 |
Number of pages | 9 |
Journal | IEEE Transactions on Visualization and Computer Graphics |
Volume | 10 |
Issue number | 5 |
DOIs | |
State | Published - Sep 2004 |
Keywords
- Crest lines
- Curvature
- Segmentation
- Surface flattening
ASJC Scopus subject areas
- Software
- Signal Processing
- Computer Vision and Pattern Recognition
- Computer Graphics and Computer-Aided Design