VC
1998
13 years 4 months ago
1998
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
JGT
2006
13 years 4 months ago
2006
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...
COMPGEOM
1999
ACM
13 years 9 months ago
1999
ACM
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 ...
ICCSA
2005
Springer
13 years 10 months ago
2005
Springer
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...
SIGECOM
2009
ACM
13 years 11 months ago
2009
ACM
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...