NDLI: Simplification of tetrahedral meshes with error bounds

Please wait, while we are loading the content...

Simplification of tetrahedral meshes with error bounds

Content Provider	IEEE Xplore Digital Library
Author	Trotts, I.J. Hamann, B. Joy, K.I.
Copyright Year	1995
Abstract	Presents a method for the construction of multiple levels of tetrahedral meshes approximating a trivariate scalar-valued function at different levels of detail. Starting with an initial, high-resolution triangulation of a 3D region, we construct coarser representation levels by collapsing edges of the mesh. Each triangulation defines a linear spline function, where the function values associated with the vertices are the spline coefficients. Error bounds are stored for individual tetrahedra and are updated as the mesh is simplified. Two algorithms are presented that simplify the mesh within prescribed error bounds. Each algorithm treats simplification on the mesh boundary. The result is a hierarchical data description that is suited for the efficient visualization of large data sets at varying levels of detail.
Sponsorship	IEEE Computer Society Technical Committee on Computer Graphics IEEE Computer Society
Starting Page	224
Ending Page	237
Page Count	14
File Size	1911004
File Format	PDF
ISSN	10772626
Volume Number	5
Issue Number	3
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1999-07-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data visualization Spline Computer errors Legged locomotion Error correction Acoustic scattering Large-scale systems Chemicals Surface contamination Data mining
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Signal Processing Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Simplification of Tetrahedral Meshes with Error Bounds

Streaming Simplification of Tetrahedral Meshes

Locally toleranced surface simplification

Simplification of three-dimensional density maps

Constructing hierarchies for triangle meshes

Selective refinement queries for volume visualization of unstructured tetrahedral meshes

Corrections to compressed progressive meshes

Manifold-guaranteed out-of-core simplification of large meshes with controlled topological type

Stable Feature Flow Fields

Simplification of tetrahedral meshes with error bounds

Similar Documents

Simplification of Tetrahedral Meshes with Error Bounds

Streaming Simplification of Tetrahedral Meshes

Locally toleranced surface simplification

Simplification of three-dimensional density maps

Constructing hierarchies for triangle meshes

Selective refinement queries for volume visualization of unstructured tetrahedral meshes

Corrections to compressed progressive meshes

Manifold-guaranteed out-of-core simplification of large meshes with controlled topological type

Stable Feature Flow Fields

Simplification of tetrahedral meshes with error bounds