Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Vorsatz, Jens
Seidel, Hans-Peter

dblp
dblp



Editor(s):

Reiners, D.

dblp



BibTeX cite key*:

Vorsatz:2003:FDC

Title, Booktitle

Title*:

A Framework for Dynamic Connectivity Meshes


osg03.pdf (173.06 KB)

Booktitle*:

OpenSG Symposium 2003

Event, URLs

URL of the conference:

http://www.opensg.org/OpenSG2003/index.EN.html

URL for downloading the paper:


Event Address*:

Darmstadt, Germany

Language:

English

Event Date*
(no longer used):

March, 31

Organization:

ACM, Eurographics

Event Start Date:

24 April 2003

Event End Date:

28 April 2003

Publisher

Name*:

ACM

URL:


Address*:

New York, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

49-55

Year*:

2003

VG Wort Pages:


ISBN/ISSN:


Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Implementing algorithms that are based on dynamic triangle meshes
often requires updating internal data-structures as soon as the
connectivity of the mesh changes. The design of a class hierarchy
that is able to deal with such changes is particularly challenging if the system reaches a certain complexity.

The paper proposes a software design that enables the users to
efficiently implement algorithms that can handle these dynamic
changes while still maintaining a certain encapsulation of the
single components.

Our design is based on a callback mechanism. A client can register at some {\tt Info}-object and gets informed whenever a change of the connectivity occurs. This way the client is able to keep internal data up-to-date. Our framework enables us to write small client classes that cover just a small dedicated aspect of necessary updates related to the changing connectivity. These small components can be combined to more complex modules and can often easily be reused. Moreover, we do not have to store related 'dynamic data' in one central place, e.g. the mesh, which could lead to a significant memory overhead if an application uses some modules just for a short time.

We have used and tested this class design extensively for
implementing 'Dynamic Connectivity Meshes and
Applications~\cite{Vorsatz:2003:DRA}'. Additionally, as a
feasibility study, we have implemented and integrated our concept in the \OM-framework.



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Computer Graphics Group

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{Vorsatz:2003:FDC,
AUTHOR = {Vorsatz, Jens and Seidel, Hans-Peter},
EDITOR = {Reiners, D.},
TITLE = {A Framework for Dynamic Connectivity Meshes},
BOOKTITLE = {OpenSG Symposium 2003},
PUBLISHER = {ACM},
YEAR = {2003},
ORGANIZATION = {ACM, Eurographics},
PAGES = {49--55},
ADDRESS = {Darmstadt, Germany},
}


Entry last modified by Anja Becker, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
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)
Jens Vorsatz
Created
03/18/2003 09:42:59 AM
Revisions
7.
6.
5.
4.
3.
Editor(s)
Anja Becker
Christine Kiesel
Christine Kiesel
Conny Liegl
Conny Liegl
Edit Dates
12.07.2004 14:00:23
07.07.2004 15:33:46
30.06.2004 15:00:30
15.01.2004 13:50:00
13.01.2004 12:34:10
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
osg03.pdf