Sciweavers

20 search results - page 2 / 4
» Maximizing Maximal Angles for Plane Straight-Line Graphs
Sort
View
CCCG
2007
13 years 9 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
GD
2006
Springer
13 years 11 months ago
Morphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
Stephen G. Kobourov, Matthew Landis
ICCV
2009
IEEE
13 years 5 months ago
Building recognition using sketch-based representations and spectral graph matching
In this work, we address the problem of building recognition across two camera views with large changes in scales and viewpoints. The main idea is to construct a semantically rich...
Yu-Chia Chung, Tony X. Han, Zhihai He
COMPGEOM
2006
ACM
14 years 1 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
GD
1999
Springer
13 years 11 months ago
Visibility Representations of Complete Graphs
Abstract. In this paper we study 3-dimensional visibility representations of complete graphs. The vertices are represented by equal regular polygons lying in planes parallel to the...
Robert Babilon, Helena Nyklová, Ondrej Pang...