2016
DOI: 10.1016/j.cag.2016.07.001
|View full text |Cite
|
Sign up to set email alerts
|

Surfacing curve networks with normal control

Abstract: Recent surface acquisition technologies based on microsensors produce three-space tangential curve data which can be transformed into a network of space curves with surface normals. This paper addresses the problem of surfacing an arbitrary closed 3D curve network with given surface normals. Thanks to the normal vector input, the patch finding problem can be solved unambiguously and an initial piecewise smooth triangle mesh is computed. The input normals are propagated throughout the mesh. Together with the in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 42 publications
0
9
0
Order By: Relevance
“…In order to smooth arbitrary triangle meshes while satisfying G 1 boundary conditions, a new algorithm was presented in [17] to numerically solve a PDE with the discrete Laplace-Beltrami operator and 1-neighborhood based discretization of the mean curvature normal at a vertex. The discrete Laplace-Beltrami operator was also used to obtain variational minimization for surface deformations in [18], estimate surface normal in [14], and perform surface reconstruction in [15].…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to smooth arbitrary triangle meshes while satisfying G 1 boundary conditions, a new algorithm was presented in [17] to numerically solve a PDE with the discrete Laplace-Beltrami operator and 1-neighborhood based discretization of the mean curvature normal at a vertex. The discrete Laplace-Beltrami operator was also used to obtain variational minimization for surface deformations in [18], estimate surface normal in [14], and perform surface reconstruction in [15].…”
Section: Methodsmentioning
confidence: 99%
“…PDE-based geometric modeling has been intensively studied. Various numerical methods such as the finite element method [9,10,11], finite difference method [12,13], and direct discretization of polygonal models using a discrete Laplace operator [14,15] etc. have been proposed to solve PDEs for hybrid subdivision surface design [16], surface reconstruction [15], estimation of surface normal [14], smoothing arbitrary triangle meshes [17], surface deformations [18], defining geometric solid models [19], surface modeling [20,9], and direct shape manipulation [8] etc.…”
Section: Introductionmentioning
confidence: 99%
“…However, freehand 3D sketches are highly unstructured (e.g., incomplete strokes, over-sketching, missing junctions, etc. ), whereas existing methods for surfacing 3D wireframes generally require a clean, connected graph [Bessmeltsev et al 2012;Pan et al 2015;Stanko et al 2016]. Due to its resilience to sparse and non-uniform sampling, our method is well-suited to perform this challenging surfacing task.…”
Section: Comparisonsmentioning
confidence: 95%
“…If a patch contains rulings, then the corresponding 3D curves can be trivially associated to a mesh by triangulating consecutive rulings, which does not require the introduction of interior points. If not, we generate a surface with minimal mean curvature interpolating the 3D border using the variational Laplacian approach [27,2]. In this case, the connectivity of this mesh is generated using a Delaunay triangulation of the 2D patch contours, where triangles are constrained to have a maximal area of 10% of the diagonal of the input image.…”
Section: Developable Surface Generationmentioning
confidence: 99%