Ponències/Comunicacions de congressos
Recent Submissions
-
Matching random colored points with rectangles
(Springer, 2020)
Conference report
Open AccessLet S[0,1]2 be a set of n points, randomly and uniformly selected. Let RB be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the random ... -
Algorithmic geometry with infinite time computation
(2021)
Conference report
Restricted access - publisher's policy -
On maximum-sum matchings of points
(2021)
Conference report
Restricted access - publisher's policyHuemer et al. (Discrete Math., 2019) proved that for any two point sets R and B with |R| = |B|, the perfect matching that matches points of R with points of B, and maximizes the total squared Euclidean distance of the ... -
Terrain prickliness: theoretical grounds for high complexity viewsheds
(2021)
Conference report
Open AccessAn important task when working with terrain models is computing viewsheds: the parts of the terrain visible from a given viewpoint. When the terrain is modeled as a polyhedral terrain, the viewshed is composed of the union ... -
Terrain prickliness: theoretical grounds for low complexity viewsheds
(2021)
Conference report
Restricted access - publisher's policy -
Shortest paths in portalgons
(2021)
Conference report
Restricted access - publisher's policy -
On (a, k)-sets and (a, k)-hulls in the plane
(2021)
Conference report
Open AccessThis abstract reports first the study of upper and lower bounds for the maximum number of all the combinatorially different (a, k)-sets of an n-point set P in the plane, 0 < a = p and 0 < 2k < n, depending on the ... -
The edge labeling of higher order Voronoi diagrams
(2021)
Conference report
Open AccessWe present an edge labeling of order-k Voronoi diagrams, Vk(S), of point sets S in the plane, and study properties of the regions defined by them. Among them, we show that Vk(S) has a small orientable cycle and path double ... -
Farthest color Voronoi diagrams: complexity and algorithms
(Springer, 2021)
Conference report
Restricted access - publisher's policyThe farthest-color Voronoi diagram (FCVD) is a farthestsite Voronoi structure defined on a family P of m point-clusters in the plane, where the total number of points is n. The FCVD finds applications in problems related ... -
Flips in higher order Delaunay triangulations
(2021)
Conference report
Restricted access - publisher's policyWe study the flip graph of higher order Delaunay triangulations. A triangulation of a set S of n points in the plane is order-k Delaunay if for every triangle its circumcircle encloses at most k points of S. The flip graph ... -
Affine invariant triangulations
(2019)
Conference report
Restricted access - publisher's policyWe study affine invariant 2D triangulation methods. That is, methods that produce the same triangulation for a point set S for any (unknown) affine transformation of S. Our work is based on a method by Nielson [A ... -
Hamiltonicity for convex shape Delaunay and Gabriel Graphs
(Springer, 2019)
Conference report
Restricted access - publisher's policyWe study Hamiltonicity for some of the most general variants of Delaunay and Gabriel graphs. Instead of defining these proximity graphs using circles, we use an arbitrary convex shape C. Let S be a point set in the plane. ...
RSS 1.0