European Workshop on Computational Geometry (20th. 2004. Sevilla): Envíos recientes
Mostrando ítems 41-56 de 56
-
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
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
Space-efficient geometric divide-and-conquer algorithms
(2004)We present an approach to simulate divide-and-conquer algorithms in a space-efficient way, and illustrate it by giving ...
-
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
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
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
(2004)Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there ...
-
Ponencia
3D realization of two triangulations of a onvex polygon
(2004)We study the problem of construction of a convex 3-polytope whose (i) shadow boundary has n vertices and (ii) two hulls, ...
- Ponencia
- Ponencia
- Ponencia
-
Ponencia
The siphon problem
(2004)An α-siphon is the locus of points in the plane that are at the same distance ǫ from a polygonal chain consisting of two ...
-
Ponencia
A certified conflict locator for the incremental maintenance of the Delaunay graph of semi-algebraic sets
(2004)Most of the curves and surfaces encountered in geometric modelling are defined as the set of solutions of a system of ...
-
Ponencia
Approximate distance oracles for graphs with dense clusters
(2004)Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that ...
-
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
Curvature criteria to fit curves to discrete data
(2004)Several geometric criteria to fit a polygonal closed curve to discrete two-dimensional data are considered and analysed. ...
-
Ponencia
A quadratic distance bound on sliding between crossing-free spanning trees
(2004)Let S be a set of n points in the plane and let TS be the set of all crossing-free spanning trees of S. We show that any ...