Browsing European Workshop on Computational Geometry (20th. 2004. Sevilla) by Title
Now showing items 1-20 of 56
-
Presentation
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, ...
-
Presentation
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 ...
-
Presentation
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 ...
-
Presentation
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 ...
-
Presentation
A simple and less slow method for counting triangulations and for related problems
(2004)We present a simple dynamic programming based method for counting straight-edge triangulations of planar point sets. This ...
-
Presentation
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 ...
- Presentation
-
Presentation
Balanced intervals of two stes of points on a line or circle
(2004)Let n,m, k, h be positive integers such that 1 ≤ n ≤ m, 1 ≤ k ≤ n and 1 ≤ h ≤ m. Then we give a necessary and sufficient ...
-
Presentation
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. ...
-
Presentation
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 ...
-
Presentation
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 ...
- Presentation
-
Presentation
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. ...
-
Presentation
Defining discrete Morse functions on infinite surfaces
(2004)We present an algorithm which defines a discrete Morse function in Forman’s sense on an infinite surface including a study of the minimality of this function.
-
Presentation
Distributed ranking methods for geographic information retrieval
(2004)Geographic Information Retrieval is concerned with retrieving documents that are related to some location. This paper ...
- Presentation
-
Presentation
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 ...
-
Presentation
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 ...
-
Presentation
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 ...
-
Presentation
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. ...