5 search results - page 1 / 1 » Small Strictly Convex Quadrilateral Meshes of Point Sets |
CORR
2002
Springer
13 years 4 months ago
2002
Springer
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
SODA
2003
ACM
13 years 5 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
IMR
2004
Springer
13 years 9 months ago
2004
Springer
A great challenge for flow simulators of new generation is to gain more accuracy at well proximity within complex geological structures. For this purpose, a new approach based on...
ICML
2007
IEEE
14 years 5 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...
GMP
2006
IEEE
13 years 10 months ago
2006
IEEE
A well-documented problem of Catmull and Clark subdivision is that, in the neighborhood of extraordinary point, the curvature is unbounded and fluctuates. In fact, since one of th...