Please note that eDoc will be permanently shut down in the first quarter of 2021!      Home News About Us Contact Contributors Disclaimer Privacy Policy Help FAQ

Home
Search
Quick Search
Advanced
Fulltext
Browse
Collections
Persons
My eDoc
Session History
Login
Name:
Password:
Documentation
Help
Support Wiki
Direct access to
document ID:


          Institute: MPI für Informatik     Collection: Computer Graphics Group     Display Documents



ID: 231348.0, MPI für Informatik / Computer Graphics Group
Spline Approximation of General Volumetric Data
Authors:Rössl, Christian; Zeilfelder, Frank; Nürnberger, Günther; Seidel, Hans-Peter
Editors:Elber, Gershon; Patrikalakis, Nick; Brunet, Pere
Language:English
Publisher:Eurographics
Place of Publication:Aire-la-Ville, Switzerland
Date of Publication (YYYY-MM-DD):2004
Title of Proceedings:Proceedings of the 9th ACM Symposium on Solid Modeling and Applications (SM 2004)
Start Page:71
End Page:82
Place of Conference/Meeting:Genova, Italy
(Start) Date of Conference/Meeting
 (YYYY-MM-DD):
2004-06-09
Audience:Experts Only
Intended Educational Use:No
Abstract / Description:We present an efficient algorithm for approximating huge general
volumetric data sets, i.e.~the data is given over arbitrarily shaped
volumes and consists of up to millions of samples. The method is based
on cubic trivariate splines, i.e.~piecewise polynomials of total
degree three defined w.r.t. uniform type-6 tetrahedral partitions of
the volumetric domain. Similar as in the recent bivariate
approximation approaches, the splines in three variables
are automatically determined from the discrete data as a result of a
two-step method, where local discrete least
squares polynomial approximations of varying degrees are extended by
using natural conditions, i.e.the continuity and smoothness properties
which determine the underlying spline space. The main advantages of
this approach with linear algorithmic complexity are as follows: no
tetrahedral partition of the volume data is needed, only small
linear systems have to be solved, the local variation and
distribution of the data is automatically adapted,
Bernstein-B{\'e}zier techniques well-known in Computer Aided
Geometric Design (CAGD) can be fully exploited, noisy data are
automatically smoothed. Our numerical examples with huge data sets
for synthetic data as well as some real-world data confirm the
efficiency of the methods, show the high quality of the spline
approximation, and illustrate that the rendered iso-surfaces inherit
a visual smooth appearance from the volume approximating splines.
Last Change of the Resource (YYYY-MM-DD):2005-04-27
External Publication Status:published
Document Type:Conference-Paper
Communicated by:Hans-Peter Seidel
Affiliations:MPI für Informatik/Computer Graphics Group
Identifiers:LOCALID:C125675300671F7B-F422C083451D4DC4C1256E76002C2509-...
ISBN:3-905673-55-X
Full Text:
You have privileges to view the following file(s):
sm04.pdf  [4,00 Mb] [Comment:file from upload service]  
 
The scope and number of records on eDoc is subject to the collection policies defined by each institute - see "info" button in the collection browse view.