MPI-INF Logo
Publications

Server    domino.mpi-inf.mpg.de

Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop

Author, Editor
Author(s):
Vorsatz, Jens
Kähler, Kolja
Kobbelt, Leif
Seidel, Hans-Peter		dblp
dblp
dblp
dblp
Editor(s):
Girod, Bernd
Greiner, Günther
Niemann, Heinrich
Seidel, Hans-Peter		dblp
dblp
dblp
dblp
Not MPII Editor(s):
Girod, Bernd
Greiner, Günther
Niemann, Heinrich
BibTeX cite key*:
Vorsatz:LTMS:00
Title, Booktitle
Title*:
Linear Time Mesh Simplification with Reliable Error-Bounds
vmv00_ltms.pdf.gz (322.56 KB)
Booktitle*:
Proceedings of Vision, Modeling, and Visualization (VMV-00)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Saarbrücken, Germany
Language:
English
Event Date*
(no longer used):
November 22-24
Organization:
Event Start Date:
Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected
Event End Date:
Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected Incorrect data type for operator or @Function: Time/Date expected
Publisher
Name*:
Akademische Verlagsgesellschaft Aka
URL:
Address*:
Berlin, Germany
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
November
Pages:
145-152
Year*:
2000
VG Wort Pages:
17
ISBN/ISSN:
3-89838-019-X
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
This paper proposes an incremental mesh reduction scheme that
provides fine grained control over the approximation error while
being linear in time in the number of vertices. We use the
well--known half--edge collapse as our atomic decimation operation
but we differ from previously reported methods in that we use a
sequence of oriented bounding-boxes to track the decimation error
instead of retaining the complete vertex information of the original
model. This reduces storage costs and computation time while still
providing a reliable upper bound for the deviation from the original
data. We also propose different error accumulation strategies which
makes the algorithm adaptable to different application scenarios.
Keywords:
mesh decimation, simplification
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, working group publication list



BibTeX Entry:

@INPROCEEDINGS{Vorsatz:LTMS:00,
AUTHOR = {Vorsatz, Jens and K{\"a}hler, Kolja and Kobbelt, Leif and Seidel, Hans-Peter},
 EDITOR = {Girod, Bernd and Greiner, G{\"u}nther and Niemann, Heinrich and Seidel, Hans-Peter},
 TITLE = {Linear Time Mesh Simplification with Reliable Error-Bounds},
 BOOKTITLE = {Proceedings of Vision, Modeling, and Visualization (VMV-00)},
 PUBLISHER = {Akademische Verlagsgesellschaft Aka},
 YEAR = {2000},
 PAGES = {145--152},
 ADDRESS = {Saarbr{\"u}cken, Germany},
 MONTH = {November},
 ISBN = {3-89838-019-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)
Kolja Kähler		Created
12/18/2000 18:38:54
Revisions
7.
6.
5.
4.
3.		Editor(s)
Christine Kiesel
Michael Gösele
Jens Vorsatz
Anja Becker
Anja Becker		Edit Dates
22.08.2003 15:57:04
28.08.2001 18:53:40
04/04/2001 15:29:26
16.03.2001 13:30:22
16.03.2001 13:28:31

File Attachment Icon
vmv00_ltms.pdf.gz