Buscar
Mostrando ítems 31-40 de 56
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 algebraic equations or inequalities (semi-algebraic sets). The Voronoi diagram of a set of sites is a ...
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 a characterization of the 1-corner corridors that we call locally widest. Our approach to finding ...
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. We assume that each point in P is uniformly distributed in an axis-aligned hypercube of side ...
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. Most of these criteria are related to the concept of curvature, for example, one criterion is ...
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 most two points. The upper bound for constructing those arrangements by an incremental method is, up ...
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 whether the door is located left hand or right hand to its start point. This problem can be solved with ...