92 search results - page 14 / 19 » The Number of Triangulations on Planar Point Sets |
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
GD
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
ALGORITHMICA
1999
13 years 8 months ago
1999
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
ALGORITHMICA
2007
13 years 8 months ago
2007
d abstract) Lars Arge1 , Darren Erik Vengroff2 , and Jeffrey Scott Vitter3 1 BRICS† , Department of Computer Science, University of Aarhus, Aarhus, Denmark 2 Department of Comp...
EJC
2010
13 years 8 months ago
2010
In this paper, we investigate some properties of partial covers of PG(n, q). We show that a set of q + a hyperplanes, q 81, a < (q - 1)/3, or q > 13 and a (q - 10)/4, that...