Buscar
Mostrando ítems 21-30 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 the double chain. We also derive a new asymptotic lower bound for the maximal number of pseudotriangulations ...
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 of C, correspondingly. We show that any such curve C has a geometric dilation of at least arcsin( ...
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 half-lines emanating from a common point such that α is the interior angle of the half-lines. Given ...
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 edges incident to reflex vertices towards INT(P). In Tomás, A. P., Bajuelos, A. L., Marques, F.: ...
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. The search ratio is the worst-case ratio before the goal is found while moving along some search ...
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 a set of given points. It encloses as particular cases to two of the most known problems in Location ...
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 geometric objects in the confi guration; determining the hypothesis conditions of the confi ...