31 search results - page 3 / 7 » ijcga 2006 |
IJCGA
2000
13 years 9 months ago
2000
IJCGA
2002
13 years 9 months ago
2002
IJCGA
2007
13 years 9 months ago
2007
Given a set of n points in the plane, we consider the problem of computing the circular ordering of the points about a viewpoint q and efficiently maintaining this ordering inform...
IJCGA
2000
13 years 9 months ago
2000
We use circle-packing methods to generate quadrilateral meshes for polygonal domains, with guaranteed bounds both on the quality and the number of elements. We show that these met...
IJCGA
2002
13 years 9 months ago
2002
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...