Sciweavers

83 search results - page 5 / 17
» Enumeration of Regular Triangulations
Sort
View
ECCV
1998
Springer
14 years 9 months ago
From Regular Images to Animated Heads: A Least Squares Approach
Abstract. We show that we can e ectively t arbitrarily complex animation models to noisy image data. Our approach is based on leastsquares adjustment using of a set of progressivel...
Pascal Fua, C. Miccio
COMPGEOM
2010
ACM
13 years 11 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
CCCG
2010
13 years 8 months ago
Regular labelings and geometric structures
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
David Eppstein
JUCS
2002
106views more  JUCS 2002»
13 years 7 months ago
Additive Distances and Quasi-Distances Between Words
: We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-pres...
Cristian Calude, Kai Salomaa, Sheng Yu
CPC
1998
154views more  CPC 1998»
13 years 7 months ago
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
Brendan D. McKay, Robert W. Robinson