loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Jaya Sreevalsan-Nair 1 ; Bernd Hamann 1 and Lars Linsen 2

Affiliations: 1 University of California, United States ; 2 Department of Mathematics and Computer Science, Germany

ISBN: 972-8865-39-2

Keyword(s): Computational Geometry, Geometric Modeling, Contour, Isosurface, Dual Isosurfacing, Triangulation.

Related Ontology Subjects/Areas/Topics: Computer Vision, Visualization and Computer Graphics ; Geometric Computing ; Geometry and Modeling ; Modeling and Algorithms

Abstract: Isosurface extraction using “dual contouring” approaches have been developed to generate a surface that is “dual” in terms of the underlying extraction procedure used when compared to the standard Marching Cubes (MC) method. These approaches address some shortcomings of the MC methods including feature-detection within a cell and better triangles. One approach for preserving “sharp features” within a cell is to determine isosurface points inside each cell by minimizing a quadric error functions (QEF). However, this category of methods is constrained in certain respects such as finding just one isosurface point per cell or requiring Hermite data to calculate an isosurface. We present a simple method based on the MC method and the ray intersection technique to compute isosurface points in the cell interior. One of the advantages of our method is that it does not require Hermite data, i.e., the discrete scalar values at vertices suffice. We compute ray intersections to determine isosurfa ce points in the interior of each cell, and then perform a complete analysis of all possible configurations to generate a look-up table for all configurations. Since complex features (e.g., tunnels) tend to be undersampled with “dual” points sufficient to represent sharp features and disjoint surfaces within the cell, we use the look-up table to optimize the ray intersection method to obtain minimum number of points necessarily sufficient for defining topologically correct isosurfaces in all possible configurations. Isosurface points are connected using a simple strategy. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.234.208.87

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Sreevalsan-Nair J.; Hamann B.; Linsen L. and (2006). USING RAY INTERSECTION FOR DUAL ISOSURFACING.In Proceedings of the First International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, ISBN 972-8865-39-2, pages 34-42. DOI: 10.5220/0001352300340042

@conference{grapp06,
author={Jaya Sreevalsan{-}Nair and Bernd Hamann and Lars Linsen},
title={USING RAY INTERSECTION FOR DUAL ISOSURFACING},
booktitle={Proceedings of the First International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,},
year={2006},
pages={34-42},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001352300340042},
isbn={972-8865-39-2},
}

TY - CONF

JO - Proceedings of the First International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,
TI - USING RAY INTERSECTION FOR DUAL ISOSURFACING
SN - 972-8865-39-2
AU - Sreevalsan-Nair, J.
AU - Hamann, B.
AU - Linsen, L.
PY - 2006
SP - 34
EP - 42
DO - 10.5220/0001352300340042

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.