Listar European Workshop on Computational Geometry (20th. 2004. Sevilla) por fecha de publicación
Mostrando ítems 21-40 de 56
-
Ponencia
On the number of pseudo-triangulations of certain point sets
(2004)We compute the exact number of pseudo-triangulations for two prominent point sets, namely the so-called double circle and ...
- Ponencia
-
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
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
-
Ponencia
Partitioning orthogonal polygons by extension of all edges incident to reflex vertices: lower and upper bounds on the number of pieces
(2004)Given an orthogonal polygon P, let |Π(P)| be the number of rectangles that result when we partition P by extending the ...
-
Ponencia
Competitive search ratio of graphs and polygons
(2004)We consider the problem of searching for a goal in an unknown environment, which may be a graph or a polygonal environment. ...
-
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
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
A completion of hypotheses method for 3D-geometry. 3D-extensions of Ceva and Menelaus theorems
(2004)A method that automates hypotheses completion in 3D-Geometry is presented. It consists of three processes: defi ning the ...
- Ponencia
-
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
-
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
Smoothed number of extreme points under uniform noise
(2004)We analyze the maximal expected number of extreme points of a point set P in Rd that is slightly perturbed by random noise. ...
-
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
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
-
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