Sciweavers

CCCG
2003
13 years 5 months ago
Encoding Quadrilateral Meshes
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encod...
Asish Mukhopadhyay, Quanbin Jing
CCCG
2003
13 years 5 months ago
Computing the Closest Point to a Circle
In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
Pinaki Mitra, Asish Mukhopadhyay, S. V. Rao
CCCG
2003
13 years 5 months ago
Computing Delaunay Triangulation with Imprecise Input Data
The key step in the construction of the Delaunay triangulation of a finite set of planar points is to establish correctly whether a given point of this set is inside or outside t...
Ali Asghar Khanban, Abbas Edalat
CCCG
2003
13 years 5 months ago
An algorithm for the MaxMin area triangulation of a convex polygon
Given a convex polygon in the plane, we are interested in triangulations of its interior, i.e. maximal sets of nonintersecting diagonals that subdivide the interior of the polygon...
J. Mark Keil, Tzvetalin S. Vassilev
CCCG
2003
13 years 5 months ago
On shortest paths in line arrangements
In this paper, we show that the shortest path between two points in a grid-like arrangement of two pencils of lines has a particularly simple structure, as was previously conjectu...
Telikepalli Kavitha, Kasturi R. Varadarajan
CCCG
2003
13 years 5 months ago
On Polyhedra Induced by Point Sets in Space
Ferran Hurtado, Godfried T. Toussaint, Joan Trias
CCCG
2003
13 years 5 months ago
Hinged Dissection of Polygons is Hard
We show several natural questions about hinged dissections of polygons to be PSPACE-hard. The most basic of these is: Given a hinged set of pieces and two configurations for them...
Robert A. Hearn, Erik D. Demaine, Greg N. Frederic...
CCCG
2003
13 years 5 months ago
Equiprojective Polyhedra
A convex polyhedron P is equiprojective if, for some k, the orthogonal projection (or “shadow”) of P in every direction, except those directions parallel to faces of P, is a k...
Masud Hasan, Anna Lubiw
CCCG
2003
13 years 5 months ago
Shortest Paths in Two Intersecting Pencils of Lines
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
David Hart