2,282 research outputs found
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Given a set of spheres in , with and
odd, having a fixed number of distinct radii , we
show that the worst-case combinatorial complexity of the convex hull
of is
, where
is the number of spheres in with radius .
To prove the lower bound, we construct a set of spheres in
, with odd, where spheres have radius ,
, and , such that their convex hull has combinatorial
complexity
.
Our construction is then generalized to the case where the spheres have
distinct radii.
For the upper bound, we reduce the sphere convex hull problem to the problem
of computing the worst-case combinatorial complexity of the convex hull of a
set of -dimensional convex polytopes lying on parallel hyperplanes
in , where odd, a problem which is of independent
interest. More precisely, we show that the worst-case combinatorial complexity
of the convex hull of a set
of -dimensional convex polytopes lying on parallel hyperplanes of
is
, where
is the number of vertices of .
We end with algorithmic considerations, and we show how our tight bounds for
the parallel polytope convex hull problem, yield tight bounds on the
combinatorial complexity of the Minkowski sum of two convex polytopes in
.Comment: 22 pages, 5 figures, new proof of upper bound for the complexity of
the convex hull of parallel polytopes (the new proof gives upper bounds for
all face numbers of the convex hull of the parallel polytopes
Convex Hulls, Oracles, and Homology
This paper presents a new algorithm for the convex hull problem, which is
based on a reduction to a combinatorial decision problem
POLYTOPE-COMPLETENESS-COMBINATORIAL, which in turn can be solved by a
simplicial homology computation. Like other convex hull algorithms, our
algorithm is polynomial (in the size of input plus output) for simplicial or
simple input. We show that the ``no''-case of
POLYTOPE-COMPLETENESS-COMBINATORIAL has a certificate that can be checked in
polynomial time (if integrity of the input is guaranteed).Comment: 11 pages, 2 figure
Convex Hull of Points Lying on Lines in o(n log n) Time after Preprocessing
Motivated by the desire to cope with data imprecision, we study methods for
taking advantage of preliminary information about point sets in order to speed
up the computation of certain structures associated with them.
In particular, we study the following problem: given a set L of n lines in
the plane, we wish to preprocess L such that later, upon receiving a set P of n
points, each of which lies on a distinct line of L, we can construct the convex
hull of P efficiently. We show that in quadratic time and space it is possible
to construct a data structure on L that enables us to compute the convex hull
of any such point set P in O(n alpha(n) log* n) expected time. If we further
assume that the points are "oblivious" with respect to the data structure, the
running time improves to O(n alpha(n)). The analysis applies almost verbatim
when L is a set of line-segments, and yields similar asymptotic bounds. We
present several extensions, including a trade-off between space and query time
and an output-sensitive algorithm. We also study the "dual problem" where we
show how to efficiently compute the (<= k)-level of n lines in the plane, each
of which lies on a distinct point (given in advance).
We complement our results by Omega(n log n) lower bounds under the algebraic
computation tree model for several related problems, including sorting a set of
points (according to, say, their x-order), each of which lies on a given line
known in advance. Therefore, the convex hull problem under our setting is
easier than sorting, contrary to the "standard" convex hull and sorting
problems, in which the two problems require Theta(n log n) steps in the worst
case (under the algebraic computation tree model).Comment: 26 pages, 5 figures, 1 appendix; a preliminary version appeared at
SoCG 201
Generating Property-Directed Potential Invariants By Backward Analysis
This paper addresses the issue of lemma generation in a k-induction-based
formal analysis of transition systems, in the linear real/integer arithmetic
fragment. A backward analysis, powered by quantifier elimination, is used to
output preimages of the negation of the proof objective, viewed as unauthorized
states, or gray states. Two heuristics are proposed to take advantage of this
source of information. First, a thorough exploration of the possible
partitionings of the gray state space discovers new relations between state
variables, representing potential invariants. Second, an inexact exploration
regroups and over-approximates disjoint areas of the gray state space, also to
discover new relations between state variables. k-induction is used to isolate
the invariants and check if they strengthen the proof objective. These
heuristics can be used on the first preimage of the backward exploration, and
each time a new one is output, refining the information on the gray states. In
our context of critical avionics embedded systems, we show that our approach is
able to outperform other academic or commercial tools on examples of interest
in our application field. The method is introduced and motivated through two
main examples, one of which was provided by Rockwell Collins, in a
collaborative formal verification framework.Comment: In Proceedings FTSCS 2012, arXiv:1212.657
- …