European Workshop on Computational Geometry (20th. 2004. Sevilla): Envíos recientes
Mostrando ítems 21-40 de 56
-
Ponencia
Region inter-visibility in terrains
(2004)A polyhedral terrain is the image of a piecewise linear continuous function de ned over the triangles of a triangulation ...
-
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
Computing the Fréchet distance between piecewise smooth curves
(2004)We consider the Fréchet distance between two curves which are given as a sequence of m+n curved pieces. If these pieces ...
-
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
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
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
Pointed encompassing trees
(2004)It is shown that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree, that ...
-
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
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
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
Similarity search in semialgebraic pattern spaces
(2004)We describe a general technique to construct data structures for similarity search in semialgebraic pattern spaces. These ...
-
Ponencia
Computing the convex hull of disks using only their chirotope
(2004)We show that the convex hull of a collection of n pairwise disjoint disks in the plane is computable in O(n log n) time ...
- Ponencia
-
Ponencia
Point set stratification and minimum weight structures
(2004)Three different concepts of depth in a point set are considered and compared: Convex depth, location depth and Delaunay ...
- Ponencia
-
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
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 ...
-
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
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
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 ...