Sciweavers

CCCG
2007
13 years 6 months ago
On Rolling Cube Puzzles
We analyze the computational complexity of various rolling cube puzzles.
Kevin Buchin, Maike Buchin, Erik D. Demaine, Marti...
CCCG
2007
13 years 6 months ago
A Lower Bound on the Area of a 3-Coloured Disc Packing
Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured
Peter Brass, Ferran Hurtado, Benjamin J. Lafrenier...
CCCG
2007
13 years 6 months ago
Triangulations Loosing Bundles and Weight
We introduce bundle-free triangulations, that are free of large collection of triangles overlapping a circle empty of vertices. We prove that bundle-free Steiner triangulations ca...
Cem Boyaci, Hale Erten, Alper Üngör
CCCG
2007
13 years 6 months ago
Optimal Point Set Partitioning using Rigid Motion Star Placement
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays...
Prosenjit Bose, Jason Morrison
CCCG
2007
13 years 6 months ago
Unfolding Polyhedra via Cut-Tree Truncation
We prove that an infinite class of convex polyhedra, produced by restricted vertex truncations, always unfold without overlap. The class includes the “domes,” providing a sim...
Alex Benton, Joseph O'Rourke
CCCG
2007
13 years 6 months ago
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
Nadia Benbernou, Erik D. Demaine, Martin L. Demain...
CCCG
2007
13 years 6 months ago
Terrain Representation using Right-Triangulated Irregular Networks
A quadtree-based triangulation, sometimes called an RTIN, is a common hierarchical representation of terrain for 3D visualization. In this paper we focus on the memory/error bound...
Suddha Basu, Jack Snoeyink
CCCG
2007
13 years 6 months ago
Optimal Schedules for 2-guard Room Search
We consider the problem of searching a polygonal room with two guards starting at a specified door point. While maintaining mutual visibility and without crossing the door, the g...
Stephen Bahun, Anna Lubiw
CCCG
2007
13 years 6 months ago
Homothetic Triangle Contact Representations of Planar Graphs
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
Melanie Badent, Carla Binucci, Emilio Di Giacomo, ...
CCCG
2007
13 years 6 months ago
Approximations of Geodesic Distances for Incomplete Triangular Manifolds
We present a heuristic algorithm to compute approximate geodesic distances on a triangular manifold S containing n vertices with partially missing data. The proposed method comput...
Zouhour Ben Azouz, Prosenjit Bose, Chang Shu, Stef...