Buscar
Mostrando ítems 21-30 de 38
Ponencia
Three location tapas calling for CG sauce
(2013)
Based on some recent modelling considerations in location theory we call for study of three CG constructs of Voronoi type that seem not to have been studied much before.
Ponencia
Ponencia
On 4-connected geometric graphs
(2013)
Given a set S of n points in the plane, in this paper we give a necessary and sometimes sufficient condition to build a 4-connected non-crossing geometric graph on S.
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
Abstract Voronoi diagrams
(2013)
Abstract Voronoi diagrams are a unifying framework that covers many types of concrete Voronoi diagrams. This talk reports on the state of the art, including recent progress.
Ponencia
A symbolic-numeric dynamic geometry environment for the computation of equidistant curves
(2013)
A web-based system that determines point/curve and curve/curve bisectors in a dynamic geometry system in a completely automatic way is presented. The system consists of an interactive drawing canvas where the bisector is ...
Ponencia
On the nonexistence of k-reptile simplices in R3 and R4
(2013)
A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled without overlaps by k simplices with disjoint interiors that are all mutually congruent and similar to S. For d=2, triangular ...
Ponencia
Drawing the double circle on a grid of minimum size
(2013)
In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed such a drawing in the grid [1, c ·n 3/2]2 for some constant c > 0, and showed that this grid size ...
Ponencia
Note on the number of obtuse angles in point sets
(2013)
In 1979 Conway, Croft, Erd\H{o}s and Guy proved that every set SS of nn points in general position in the plane determines at least n3/18−O(n2) obtuse angles and also presented a special set of nn points to show the upper ...
Ponencia
Guarding the vertices of thin orthogonal polygons is NP-hard
(2013)
An orthogonal polygon of P is called “thin” if the dual graph of the partition obtained by extending all edges of P towards its interior until they hit the boundary is a tree. We show that the problem of computing a minimum ...