Cerca
Ara es mostren els items 1-10 de 128
On k-enclosing objects in a coloured point set
(2014)
Text en actes de congrés.
Accés obert
Text en actes de congrés.
Accés obert
We introduce the exact coloured
k
-enclosing object
problem: given a set
P
of
n
points in
R
2
, each of
which has an associated colour in
f
1
;:::;t
g
, and a vec-
tor
c
= (
c
1
;:::;c
t
), ...
Matching points with diametral disks
(2017)
Text en actes de congrés.
Accés obert
Text en actes de congrés.
Accés obert
We consider matchings between a set R of red points and a set B of blue points with diametral disks. In other words, for each pair of matched points p ¿ R and q ¿ B, we consider the diametral disk defined by p and q. We ...
On polygons enclosing point sets II
(2009-08)
Article.
Accés obert
Article.
Accés obert
Let R and B be disjoint point sets such that $R\cup B$ is in general position. We say that B encloses by R if there is a simple polygon P with vertex set B such that all the elements
in R belong to the interior of P.
In ...
On k-gons and k-holes in point sets
(2015-08-01)
Article.
Accés obert
Article.
Accés obert
We consider a variation of the classical Erdos-Szekeres problems on the existence and number of convex k-gons and k-holes (empty k-gons) in a set of n points in the plane. Allowing the k-gons to be non-convex, we show ...
On the determining number and the metric dimension of graphs
(2010-04-19)
Article.
Accés obert
Article.
Accés obert
This paper initiates a study on the problem of computing the difference between
the metric dimension and the determining number of graphs. We provide new proofs
and results on the determining number of trees and Cartesian ...
Geometric biplane graphs II: graph augmentation
(2015-03-01)
Article.
Accés obert
Article.
Accés obert
We study biplane graphs drawn on a finite point set in the plane in general position. This is the family of geometric graphs whose vertex set is and which can be decomposed into two plane graphs. We show that every ...
Compatible spanning trees
(2014-07-01)
Article.
Accés obert
Article.
Accés obert
Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric spanning tree ...
Stabbing circles for some sets of Delaunay segments
(2016)
Text en actes de congrés.
Accés obert
Text en actes de congrés.
Accés obert
Let S be a set of n segments in the plane such that, for
every segment, its two endpoints are adjacent in the Delaunay triangulation of the set of endpoints of all segments in S. Our goal is to compute all the combinatorially ...
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
(2010)
Article.
Accés obert
Article.
Accés obert
A geometric graph is a graph G = (V;E) drawn in the plane, such that V is a point set in general position and E is
a set of straight-line segments whose endpoints belong to V . We study the following extremal problem for ...
The Plogi and ACi-1 operators on the polynomial time hierarchy
(1993-11)
Report de recerca.
Accés obert
Report de recerca.
Accés obert
In a previous paper ([CS-92]) we studied the agreement of operators P_{log^i} and AC^{i-1} acting on NP. In this article we extend this work to other classes of the polynomial time hierarchy. We show that on Sigma_k^p, ...