2000
DOI: 10.1006/gmod.1999.0514
|View full text |Cite
|
Sign up to set email alerts
|

Incremental Polygonization of Implicit Surfaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
20
0

Year Published

2001
2001
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(21 citation statements)
references
References 19 publications
(34 reference statements)
1
20
0
Order By: Relevance
“…At present, there are many research work done by researchers about polygonization of implicit surface [4][5][6][7][8], and most of them are about how to approximate implicit surface by triangle mesh with high quality and high performance.Surface tracking meethod is a family of polygonization techniques, e.g., Hartmann's algorithm [9], which also known as continuation method, it iteratively create a triangulation from a seed point by marching the surface. These approaches can achieve good results by generating meshes of evenly sized and quasi-equilateral triangles.…”
Section: Introductionmentioning
confidence: 99%
“…At present, there are many research work done by researchers about polygonization of implicit surface [4][5][6][7][8], and most of them are about how to approximate implicit surface by triangle mesh with high quality and high performance.Surface tracking meethod is a family of polygonization techniques, e.g., Hartmann's algorithm [9], which also known as continuation method, it iteratively create a triangulation from a seed point by marching the surface. These approaches can achieve good results by generating meshes of evenly sized and quasi-equilateral triangles.…”
Section: Introductionmentioning
confidence: 99%
“…In both cases, field functions with compact supports are of primary interest since they localize the field function interactions when they are composed. This leads to more predictable and controllable shape behaviors and allows us to benefit from great accelerations based on the bounding box of their support [9,10,11]. This is why this work focuses on compact field functions.…”
Section: Introductionmentioning
confidence: 99%
“…The process repeats, until the minimum cell size is reached. An interactive system utilizing this method was described in [21]. The initial cell size restriction was successfully handled by octree growing.…”
Section: Existing Polygonization Methodsmentioning
confidence: 99%
“…The second task, is local updating the polygonal mesh at the interactive rate following either an interactive operation modifying a part of the shape (e.g., [20], [21]) or simulating the change of the eye focal length when shifting the gaze from the whole shape to a little part of it (e.g., [24]). We propose a few different solutions to these problems in our work.…”
Section: Problems Of Interactive Polygonizationmentioning
confidence: 99%