839 search results - page 101 / 168 » Three-Clustering of Points in the Plane |
IJFCS
2002
13 years 10 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...
CAD
1999
Springer
13 years 10 months ago
1999
Springer
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set ...
JCO
2010
13 years 8 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
CGF
2011
13 years 1 months ago
2011
Diffusion curves are a powerful vector graphic representation that stores an image as a set of 2D Bezier curves with colors defined on either side. These colors are diffused over...
SIGGRAPH
1987
ACM
14 years 1 months ago
1987
ACM
In the course of developing a system for fitting smooth curves to camera input we have developed several direct (i.e. noniterative) methods for fitting a shape (line, circle, conic...