MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Haber, Jörg
Zeilfelder, Frank
Davydov, Oleg
Seidel, Hans-Peter
dblp
dblp
dblp
dblp
Not MPG Author(s):
Davydov, Oleg
Editor(s):
Ertl, Thomas
Joy, Ken
Varshney, Amitabh
dblp
dblp
dblp
Not MPII Editor(s):
Ertl, Thomas
Joy, Ken
Varshney, Amitabh
BibTeX cite key*:
Haber:2001:SARLSDS
Title, Booktitle
Title*:
Smooth Approximation and Rendering of Large Scattered Data Sets
Booktitle*:
Proceedings of IEEE Visualization 2001
Event, URLs
Conference URL::
http://vis.computer.org/vis01/index.html
Downloading URL:
Event Address*:
San Diego, USA
Language:
English
Event Date*
(no longer used):
October 21-26, 2001
Organization:
IEEE Computer Society
Event Start Date:
21 October 2001
Event End Date:
26 October 2001
Publisher
Name*:
IEEE
URL:
http://computer.org/
Address*:
Los Alamitos, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
October
Pages:
341-347;571
Year*:
2001
VG Wort Pages:
32
ISBN/ISSN:
0-7803-7200-X
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
We present an efficient method to automatically compute a smooth
approximation of large functional scattered data sets given over
arbitrarily shaped planar domains. Our approach is based on the
construction of a $C^1$-continuous bivariate cubic spline and our method
offers optimal approximation order. Both local
variation and non-uniform distribution of the data are taken into account
by using local polynomial least squares approximations of varying degree.
Since we only need to solve small linear systems and no triangulation of
the scattered data points is required, the overall complexity of the
algorithm is linear in the total number of points. Numerical examples
dealing with several real world scattered data sets with up to millions of
points demonstrate the efficiency of our method. The resulting spline
surface is of high visual quality and can be efficiently evaluated for
rendering and modeling. In our implementation we achieve real-time frame
rates for typical fly-through sequences and interactive frame rates for
recomputing and rendering a locally modified spline surface.
Keywords:
scattered data approximation, least squares approximation, terrain visualization, data compression
Download
Access Level:
Public

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Computer Graphics Group
Audience:
Expert
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Haber:2001:SARLSDS,
AUTHOR = {Haber, J{\"o}rg and Zeilfelder, Frank and Davydov, Oleg and Seidel, Hans-Peter},
EDITOR = {Ertl, Thomas and Joy, Ken and Varshney, Amitabh},
TITLE = {{Smooth Approximation and Rendering of Large Scattered Data Sets}},
BOOKTITLE = {Proceedings of IEEE Visualization 2001},
PUBLISHER = {IEEE},
YEAR = {2001},
ORGANIZATION = {IEEE Computer Society},
PAGES = {341--347;571},
ADDRESS = {San Diego, USA},
MONTH = {October},
ISBN = {0-7803-7200-X},
}


Entry last modified by Christine Kiesel, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Jörg Haber
Created
06/21/2001 12:55:42 PM
Revisions
15.
14.
13.
12.
11.
Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
24.05.2005 16:03:31
24.05.2005 16:03:17
24.05.2005 16:03:15
22.08.2003 15:59:27
28/05/2002 19:03:33