Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
VC
1998
66views more  VC 1998»
11 years 5 months ago
Vertex representations and their applications in computer graphics
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
Claudio Esperança, Hanan Samet
JGT
2006
70views more  JGT 2006»
11 years 5 months ago
Vertex partitions of chordal graphs
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...
David R. Wood
COMPGEOM
1999
ACM
11 years 9 months ago
Mesh Collapse Compression
We present a novel algorithm for encoding the topology of triangular meshes. A sequence of edge contract and divide operations collapses the entire mesh into a single vertex. This ...
Martin Isenburg, Jack Snoeyink
ICCSA
2005
Springer
11 years 11 months ago
Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization
We discuss the deletion of a single vertex in a Delaunay tetrahedralization (DT). While some theoretical solutions exist for this problem, the many degeneracies in three dimensions...
Hugo Ledoux, Christopher M. Gold, George Baciu
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
12 years 1 days ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
books