64 search results - page 2 / 13 » Irreducible triangulations are small |
DCG
2000
13 years 5 months ago
2000
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal trian...
AAAI
1994
13 years 6 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
ACS
2004
13 years 5 months ago
2004
Subdirect representations are investigated in varieties which are defined by operations of not necessarily finite arity. It is shown that, in this context, Birkhoff's Subdire...
IJFCS
2002
13 years 5 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
DCG
2010
13 years 5 months ago
2010
An Apollonian configuration of circles is a collection of circles in the plane with disjoint interiors such that the complement of the interiors of the circles consists of curvili...