Sciweavers

1009 search results - page 146 / 202
» On Indexing Line Segments
Sort
View
CCCG
2009
13 years 10 months ago
Inapproximability of the Perimeter Defense Problem
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...
Evangelos Kranakis, Danny Krizanc, Lata Narayanan,...
GD
2008
Springer
13 years 10 months ago
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints
In this paper we present a generalization of the shift method algorithm [4, 6] to obtain a straight-line grid drawing of a triconnected graph, where vertex representations have a c...
Seok-Hee Hong, Martin Mader
CORR
2008
Springer
66views Education» more  CORR 2008»
13 years 9 months ago
On stars and Steiner stars. II
A Steiner star for a set P of n points in Rd connects an arbitrary center point to all points of P, while a star connects a point p P to the remaining n-1 points of P. All connec...
Adrian Dumitrescu, Csaba D. Tóth, Guangwu X...
IJCGA
2008
132views more  IJCGA 2008»
13 years 9 months ago
Constructing the City Voronoi Diagram Faster
Given a set S of n point sites in the plane, the City Voronoi diagram partitions the plane into the Voronoi regions of the sites, with respect to the City metric. This metric is i...
Robert Görke, Chan-Su Shin, Alexander Wolff
JUCS
2008
104views more  JUCS 2008»
13 years 9 months ago
Table-form Extraction with Artefact Removal
: In this paper we present a novel methodology to recognize the layout structure of handwritten filled table-forms. Recognition methodology includes locating line intersections, co...
Luiz Antônio Pereira Neves, João Marq...