Listar European Workshop on Computational Geometry (20th. 2004. Sevilla) por título
Mostrando ítems 31-50 de 56
-
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
On geodesic and monophonic convexity
(2004)In this paper we deal with two types of graph convexities, which are the most natural path convexities in a graph and which ...
-
Ponencia
On geometric properties of enumerations of axis-parallel rectangles
(2004)We show that for any set of non-overlapping axis-parallel rectangles in the plane, there exists a sloping enumeration, ...
-
Ponencia
On rectangular cartograms
(2004)A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangles is chosen such that ...
-
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
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
-
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
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
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
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
-
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
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
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
Space-efficient geometric divide-and-conquer algorithms
(2004)We present an approach to simulate divide-and-conquer algorithms in a space-efficient way, and illustrate it by giving ...
- Ponencia
-
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
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 ...