Sciweavers

3005 search results - page 188 / 601
» Computational geometry for sculpture
Sort
View
140
Voted
SIAMDM
2008
90views more  SIAMDM 2008»
15 years 6 months ago
The Nine Morse Generic Tetrahedra
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
D. Siersma, M. van Manen
COMPGEOM
2004
ACM
16 years 4 days ago
The number of lines tangent to arbitrary convex polyhedra in 3D
We prove that the lines tangent to four possibly intersecting convex polyhedra in   3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
Hervé Brönnimann, Olivier Devillers, V...
SMA
2003
ACM
154views Solid Modeling» more  SMA 2003»
15 years 12 months ago
Discretization of functionally based heterogeneous objects
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
Elena Kartasheva, Valery Adzhiev, Alexander A. Pas...
VRML
2000
ACM
15 years 11 months ago
The morph node
We discuss potential and limitations of a Morph Node, inspired by the corresponding construct in Java3D. A Morph Node in Java3D interpolates vertex attributes among several homeom...
Marc Alexa, Johannes Behr, Wolfgang Müller 00...
COMPGEOM
2008
ACM
15 years 8 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...