Listar European Workshop on Computational Geometry (20th. 2004. Sevilla) por fecha de publicación
Mostrando ítems 1-20 de 56
-
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
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
-
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 ...
-
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
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
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
-
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
-
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
-
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
Unfolding simple chains inside circles
(2004)It is an open problem to determined whether a polygonal chain can be straightened inside a confi ning region if its links ...
- Ponencia
-
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
Triangulations without pointed spanning trees
(2004)Problem 50 in the Open Problems Project asks whether any triangulation on a point set in the plane contains a pointed ...
-
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
The minimum Manhattan network problem approximations and exact solutions
(2004)A Manhattan p–q path is a geodesic in the Manhattan (or L1-) metric that connects p and q, i.e. a staircase path between ...
-
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 ...