Listar European Workshop on Computational Geometry (20th. 2004. Sevilla) por título
Mostrando ítems 16-35 de 56
- Ponencia
-
Ponencia
Finding a door along a wall with an error afflicted robot
(2004)We consider the problem of finding a door in a wall with a blind robot, that does not know the distance to the door or ...
-
Ponencia
Finding a widest empty 1-corner corridor
(2004)Given a set of n points in the plane, we consider the problem of computing a widest empty 1-corner corridor. We star giving ...
-
Ponencia
Finding planar regions in a terrain
(2004)We consider the problem of computing large connected regions in a triangulated terrain of size n for which the normals of ...
-
Ponencia
Geometric data structures for multihierarchical XML tagging of manuscripts
(2004)This paper shows an application of computational geometry methods to the preparation of image-based digital library editions. ...
-
Ponencia
Geometric dilation of closed planar curves: a new lower bound
(2004)Given any simple closed curve C in the Euclidean plane, let w and D denote the minimal and the maximal caliper distances ...
-
Ponencia
Guarding art galleries by guarding witnesses
(2004)Let P be a simple polygon. We de ne a witness set W to be a set of points su h that if any (prospective) guard set G ...
-
Ponencia
Improved results for the k-centrum straight-line location problem
(2004)The k-Centrum problem consists in finding a point that minimises the sum of the distances to the k farthest points out of ...
-
Ponencia
Lower bounds for the polygon exploration problem
(2004)We improve the best known lower bound for the polygon exploration problem from 1.2071 to 1.2825.
-
Ponencia
Maximizing the area of overlap of two unions of disks under rigid motion
(2004)Let A and B be two sets of n resp. m (m ≥ n) disjoint unit disks in the plane. We consider the problem of finding a rigid ...
-
Ponencia
Maximum weight triangulation of a special convex polygon
(2004)In this paper, we investigate the maximum weight triangulation of a special convex polygon, called `semi-circled convex polygon'. We prove that the maximum weight triangulation of such a polygon can be found in O(n2) time.
-
Ponencia
Minimum number of different distances defined by a finite number of points
(2004)We study the minimum number of different distances defined by a finite number of points in the following cases: a) we ...
-
Ponencia
Minimum weight pseudo-triangulations
(2004)We consider the problem of computing a minimum weight pseudo-triangulation of a set S of n points in the plane. We first ...
-
Ponencia
New bound for incremental constructing arrangements of curves
(2004)Let A(Γ) be the arrangement induced by a set Γ of n unbounded Jordan curves in the plane that intersect each other in at ...
-
Ponencia
New lower bounds for the number of straight-edge triangulations of a planar point set
(2004)We present new lower bounds on the number of straight-edge triangulations that every set of n points in plane must have. These bounds are better than previous bounds in case of sets with either many or few extreme points.
-
Ponencia
On fencing problems
(2004)Fencing problems deal with the bisection of a convex body in a way that some geometric measures are optimized. We study ...
-
Ponencia
On geodesic and monophonic convexity
(2004)In this paper we deal with two types of graph convexities, which are the most natural path convexities in a graph and which ...
-
Ponencia
On geometric properties of enumerations of axis-parallel rectangles
(2004)We show that for any set of non-overlapping axis-parallel rectangles in the plane, there exists a sloping enumeration, ...
-
Ponencia
On rectangular cartograms
(2004)A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangles is chosen such that ...
-
Ponencia
On relative isodiametric inequalities
(2004)We consider subdivisions of convex bodies G in two subsets E and G\E. We obtain several inequalities comparing the relative ...