Wednesday, 10 August 9:00 am - 10:30 am | East Building, Ballroom A/B
Session Chair: Eugene Zhang, Oregon State University
Contributing Vertices-Based Minkowski Sum of a Nonconvex--Convex Pair of Polyhedra
An exact and efficient contributing-vertices-based algorithm for the Minkowski sum computation of a non-convex-convex pair of polyhedra. The algorithm handles non-manifold situations and extracts polyhedral holes of the sum. Several results
Hichem Barki
Université de Lyon
Florence Denis
Université de Lyon
Florent Dupont
Université de Lyon
MeshFlow: Interactive Visualization of Mesh Construction Sequences
MeshFlow is an interactive system for visualizing polygonal mesh construction sequences. It hierarchically clusters editing operations visualized with graphical annotations to provide levels of detail on demand. MeshFlow was tested on five mesh sequences and evaluated with a case study using modeling students.
Jonathan Denning
Dartmouth College
William Kerr
Dartmouth College
Fabio Pellacini
Dartmouth College and Sapienza - Università di Roma
LR: Compact Connectivity Representation for Triangle Meshes
LR is a compact data structure for representing the connectivity of manifold triangle meshes. It supports constant-time incidence and adjacency queries while storing only one integer reference per triangle. Its greedy, linear-time construction involves ordering the vertices along a nearly Hamiltonian cycle.
Topraj Gurung
Georgia Institute of Technology
Mark Luffel
Georgia Institute of Technology
Peter Lindstrom
Lawrence Livermore National Laboratory
Jarek Rossignac
Georgia Institute of Technology
On the Velocity of an Implicit Surface
Previously, only the normal component of the surface was known. This method of deriving a formula for the velocity of a time-evolving implicit surface applies the normal component to the problem of tracking particles on the surface and the problem of motion-blurring implicit surfaces.
Jos Stam