Sciweavers

CCCG
2007
13 years 6 months ago
Improved Layouts of the Multigrid Network
In a previous paper, Calamoneri and Massini studied the problem of drawing the multigrid network in “a grid of minimum area”. In this paper we show that we can draw the multig...
Shabnam Aziza, Therese C. Biedl
CCCG
2007
13 years 6 months ago
Largest Subsets of Triangles in a Triangulation
Given a triangulation of n points, with some triangles marked “good”, this paper discusses the problems of computing the largest-area connected set of good triangles that (i) ...
Boris Aronov, Marc J. van Kreveld, Maarten Lö...
CCCG
2007
13 years 6 months ago
Capturing Crossings: Convex Hulls of Segment and Plane Intersections
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoey...
CCCG
2007
13 years 6 months ago
Vertex Pops and Popturns
Greg Aloupis, Brad Ballinger, Prosenjit Bose, Mire...
CCCG
2007
13 years 6 months ago
Pointed Drawings of Planar Graphs
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
Oswin Aichholzer, Günter Rote, André S...
CCCG
2007
13 years 6 months ago
Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull
We consider the problem of two-dimensional outputsensitive convex hull in the cache-oblivious model. That is, we are interested in minimizing the number of cache faults caused whe...
Peyman Afshani, Arash Farzan
CCCG
2007
13 years 6 months ago
On Bus Graph Realizability
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doy...
CCCG
2007
13 years 6 months ago
Generalized Watchman Route Problem with Discrete View Cost
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
Pengpeng Wang, Ramesh Krishnamurti, Kamal Gupta