2003
DOI: 10.1007/978-3-540-44400-8_14
|View full text |Cite
|
Sign up to set email alerts
|

Relaxed Scheduling in Dynamic Skin Triangulation

Abstract: Abstract. We introduce relaxed scheduling as a paradigm for mesh maintenance and demonstrate its applicability to triangulating a skin surface in R 3 .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2007
2007
2011
2011

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Therefore, it needs no handling of the singularities. Several methods have been proposed for the triangulation of the skin surface [45][46][47][48][49][50]. All these surfaces can be treated as approximations to the three types of molecular surfaces.…”
Section: Prior Artmentioning
confidence: 99%
“…Therefore, it needs no handling of the singularities. Several methods have been proposed for the triangulation of the skin surface [45][46][47][48][49][50]. All these surfaces can be treated as approximations to the three types of molecular surfaces.…”
Section: Prior Artmentioning
confidence: 99%
“…The algorithms in [8,17] construct a topologically correct mesh approximating a skin surface in the special case of a shrink factor 0.5. It is likely that this algorithm can be generalized to work for arbitrary shrink factors, but this would probably result in a denser mesh in order to guarantee the topology.…”
Section: Introductionmentioning
confidence: 99%