Conference Sketches & Applications Comments Search Site Map Main
 

Geometry
 
Chair
Bryan Wyvill
University of Calgary

Polytope Sections
Using animation to compare the parallel plane sections of polyhedra with the parallel solid sections of four-dimensional star polytopes. The series of solid sections produces morphing polyhedra.
 
Russell Towle
Giant Gap Press
898 Green Valley Road
Alta, California 95714 USA
rtowle@neworld.net


CAL    Near Real-Time Cutting
A real-time cutting algorithm for virtual-reality surgical simulators is presented on polygonal objects with a mass-spring lattice.
 
Paul F. Neumann
University of Illinois at Chicago
Virtual Reality in Medicine Laboratory
1919 West Taylor Street, Room 211 AHP
Chicago, Illinois 60612 USA
paul_neumann@acm.org


A Solution to the Vertex Path Problem Using a Dependency Graph
This solution to the vertex-path problem uses a dependency graph. The source and the target shapes can have more than one piecewise linear curve.
 
Henry Johan
University of Tokyo
Department of Information Science
7-3-1 Hongo, Bunkyo-ku
Tokyo 113-0033 JAPAN
henry@is.s.u-tokyo.ac.jp

CAL    "MeshSweeper:" Fast Closest Point on a Polygonal Mesh
A new algorithm for computing the distance from a point to an arbitrary polygonal mesh. The algorithm is dynamic. It uses a priority process to exploit coherence between subsequent queries.
 
Andre Gueziec
Multigen-Paradigm, Inc.
365 America Avenue
Sunnyvale, California 94086 USA
gueziec@computer.org

 

 

SIGGRAPH 2000 Register Now
Comments Search and Site Map Main