21 search results - page 2 / 5 » Enumerating Triangulations in General Dimensions |
ASPDAC
2001
ACM
13 years 11 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
CCCG
2001
13 years 9 months ago
2001
A recent progress on the complete enumeration of oriented matroids enables us to generate all combinatorial types of small point configurations and hyperplane arrangements in gene...
COMPGEOM
2003
ACM
14 years 24 days ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
ICIP
1995
IEEE
14 years 9 months ago
1995
IEEE
A fixed-rate lattice vector quantizer for generalized Gaussian (GG) sources is presented. By using the contour of counstant probability of a generalized Gaussian source to bound t...