Dual Contouring
Dual Contouring is a mesh generation algorithm in the field of isosurface extraction that constructs a dual grid-based polygonal surface by placing one vertex per cell and solving a constrained optimization problem to preserve sharp features and maintain high fidelity to the underlying scalar field.
26
Publications
2.4K
Citations
59
Authors
32
Institutions
Publications per year
2017–2026
4
26
Dual contouring of hermite data
Tao Ju, Frank Losasso, Scott Schaefer et al. · 2002 · 591 citations
Dual contouring of hermite data
Tao Ju, Frank Losasso, Scott Schaefer et al. · ACM Transactions on Graphics · 2002 · 332 citations
1–5 of 26
59
5
h-index
5
h-index
3
h-index
3
h-index
3
h-index
1–5 of 59
32

Rice University
Houston, United States
5 h-index
13 publications
4.1K citations
University of Southampton
Southampton, United Kingdom
2 h-index
4 publications
426 citations

University of Toronto
Toronto, Canada
2 h-index
6 publications
452 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
128 citations

Beijing Normal University
Beijing, China
1 h-index
2 publications
156 citations
Texas A&M University
College Station, United States
1 h-index
1 publications
83 citations

Washington University in St. Louis
St Louis, United States
1 h-index
1 publications
83 citations
Technical University of Munich
Munich, Germany
1 h-index
2 publications
38 citations
1–8 of 32
TOG · 3 publications · 488 citations
3
h-index
2 publications · 265 citations
2
h-index
1 publications · 149 citations
1
h-index
1 publications · 64 citations
1
h-index
1 publications · 10 citations
1
h-index
1–5