Recognition and reconstruction of developable surfaces from point clouds

Peternell, Martín

doi:10.1109/gmap.2004.1290051

Cited by 6 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In [15], Pottmann and Wallner derived linear approximation algorithms for developable NURBS surfaces. Peternell [16] developed an approach to fitting a developable surface on a cloud of data points. Recently, Frey [17] proposed using a boundary triangulation to approximate a developable surface interpolating a closed space curve.…”

Section: Related Workmentioning

confidence: 99%

Developable Triangulations of a Strip

Wang¹,

Tang²

2005

Computer-Aided Design and Applications

View full text Add to dashboard Cite

This paper presents a modeling algorithm that helps automatically generate a "most" developable triangulated surface interpolating a given closed 3D boundary curve. The boundary curve is given in the form of a narrow strip which is often encountered in CAD applications like shoe and clothing wrinkle design. The triangulation geometrically simulates the folding process of a sheet as it would occur when rolled from one end of the strip to the other. The objective of maintaining the surface developability is realized by finding the "best rate" of the rolling along the boundary curve. To achieve this optimization, we convert the problem into a single-source shortest path problem on a special directed weighted graph, and utilize the famous Dijkstra's algorithm to find a minimumweight path. Examples are provided to demonstrate useful applications of the presented methodology in CAD.

show abstract

Section: Related Workmentioning

confidence: 99%

Developable Triangulations of a Strip

Wang¹,

Tang²

2005

Computer-Aided Design and Applications

View full text Add to dashboard Cite

show abstract

“…Developable surfaces: The research on developable surfaces in the modeling and graphics communities focuses predominantly on modeling with such surfaces [PW99, LP98] and on the approximation of point clouds [CLL*99, PS04, Pet04]. The proposed approximation and modeling techniques require complex manipulation of spline curves and surfaces.…”

Section: Introductionmentioning

confidence: 99%

D‐Charts: Quasi‐Developable Mesh Segmentation

Julius

Kraevoy

Sheffer

2005

Computer Graphics Forum

167

103

View full text Add to dashboard Cite

Quasi-developable mesh segmentation is required for many applications in graphics and CAD, including texture atlas generation and the design of patterns for model fabrication from sheets of material. In this work we introduce D-Charts, a simple and robust algorithm for mesh segmentation into (nearly) developable charts. As part of our method we introduce a new metric of developability for mesh surfaces. Thanks to this metric, using our segmentation for texture atlas generation, we can bound the distortion of the atlas directly during the segmentation stage. We demonstrate that by using this bound, we generate more isometric atlases for the same number of charts compared to existing state-of-the-art techniques. Using our segmentation algorithm we also develop a technique for automatic pattern design. To demonstrate the practicality of this technique, we use the patterns produced by our algorithm to make fabric and paper copies of popular computer graphics models.

show abstract

“…No obstante, partiendo de una buena aproximación inicial que permita acotar el espacio de búsqueda se podrían obtener muy buenos resultados. Algunos ejemplos son los desarrollados por (Krishnamurthy y Levoy, 1996), (Curless y Levoy, 1996), (Pottmann et al, 2002) y (Vosselman et al, 2004), quienes han desarrollado métodos automáticos y algoritmos para el ajuste de primitivas básicas, pero sólo aplicado a nubes de puntos pequeñas y estructuradas correspondientes a objetos independientes (láser de corto alcance). Por otro lado, Rabbani et al (2006) aplican primero una segmentación creciente "region growing" y posteriormente la Transformada de Hough 3D para segmentar primitivas básicas.…”

Section: Métodos De Registro Finosunclassified

Automatización en el procesamiento de datos adquiridos mediante láser escáner 3D

Gonzálvez¹

View full text Add to dashboard Cite

Recognition and reconstruction of developable surfaces from point clouds

Abstract: Abstract

Cited by 6 publications

References 11 publications

Developable Triangulations of a Strip

Developable Triangulations of a Strip

D‐Charts: Quasi‐Developable Mesh Segmentation

Automatización en el procesamiento de datos adquiridos mediante láser escáner 3D

Contact Info

Product

Resources

About