3,123 research outputs found
On characteristic points and approximate decision algorithms for the minimum Hausdorff distance
We investigate {\em approximate decision algorithms} for determining whether the minimum Hausdorff distance between two points sets (or between two sets of nonintersecting line segments) is at most .\def\eg{(\varepsilon/\gamma)} An approximate decision algorithm is a standard decision algorithm that answers {\sc yes} or {\sc no} except when is in an {\em indecision interval} where the algorithm is allowed to answer {\sc don't know}. We present algorithms with indecision interval where is the minimum Hausdorff distance and can be chosen by the user. In other words, we can make our algorithm as accurate as desired by choosing an appropriate . For two sets of points (or two sets of nonintersecting lines) with respective cardinalities and our approximate decision algorithms run in time O(\eg^2(m+n)\log(mn)) for Hausdorff distance under translation, and in time O(\eg^2mn\log(mn)) for Hausdorff distance under Euclidean motion
Congruence Testing of Point Sets in 4-Space
We give a deterministic O(n log n)-time algorithm to decide if two n-point sets in 4-dimensional Euclidean space are the same up to rotations and translations. It has been conjectured that O(n log n) algorithms should exist for any fixed dimension. The best algorithms in d-space so far are a deterministic algorithm by Brass and Knauer [Int. J. Comput. Geom. Appl., 2000] and a randomized Monte Carlo algorithm by Akutsu [Comp. Geom., 1998]. They take time O(n^2 log n) and O(n^(3/2) log n) respectively in 4-space. Our algorithm exploits many geometric structures and properties of 4-dimensional space
Symmetry Detection of Rational Space Curves from their Curvature and Torsion
We present a novel, deterministic, and efficient method to detect whether a
given rational space curve is symmetric. By using well-known differential
invariants of space curves, namely the curvature and torsion, the method is
significantly faster, simpler, and more general than an earlier method
addressing a similar problem. To support this claim, we present an analysis of
the arithmetic complexity of the algorithm and timings from an implementation
in Sage.Comment: 25 page
Taming Numbers and Durations in the Model Checking Integrated Planning System
The Model Checking Integrated Planning System (MIPS) is a temporal least
commitment heuristic search planner based on a flexible object-oriented
workbench architecture. Its design clearly separates explicit and symbolic
directed exploration algorithms from the set of on-line and off-line computed
estimates and associated data structures. MIPS has shown distinguished
performance in the last two international planning competitions. In the last
event the description language was extended from pure propositional planning to
include numerical state variables, action durations, and plan quality objective
functions. Plans were no longer sequences of actions but time-stamped
schedules. As a participant of the fully automated track of the competition,
MIPS has proven to be a general system; in each track and every benchmark
domain it efficiently computed plans of remarkable quality. This article
introduces and analyzes the most important algorithmic novelties that were
necessary to tackle the new layers of expressiveness in the benchmark problems
and to achieve a high level of performance. The extensions include critical
path analysis of sequentially generated plans to generate corresponding optimal
parallel plans. The linear time algorithm to compute the parallel plan bypasses
known NP hardness results for partial ordering by scheduling plans with respect
to the set of actions and the imposed precedence relations. The efficiency of
this algorithm also allows us to improve the exploration guidance: for each
encountered planning state the corresponding approximate sequential plan is
scheduled. One major strength of MIPS is its static analysis phase that grounds
and simplifies parameterized predicates, functions and operators, that infers
knowledge to minimize the state description length, and that detects domain
object symmetries. The latter aspect is analyzed in detail. MIPS has been
developed to serve as a complete and optimal state space planner, with
admissible estimates, exploration engines and branching cuts. In the
competition version, however, certain performance compromises had to be made,
including floating point arithmetic, weighted heuristic search exploration
according to an inadmissible estimate and parameterized optimization
Quantum and Classical Combinatorial Optimizations Applied to Lattice-Based Factorization
The availability of working quantum computers has led to several proposals
and claims of quantum advantage. In 2023, this has included claims that quantum
computers can successfully factor large integers, by optimizing the search for
nearby integers whose prime factors are all small.
This paper demonstrates that the hope of factoring numbers of commercial
significance using these methods is unfounded. Mathematically, this is because
the density of smooth numbers (numbers all of whose prime factors are small)
decays exponentially as n grows. Our experimental reproductions and analysis
show that lattice-based factoring does not scale successfully to larger
numbers, that the proposed quantum enhancements do not alter this conclusion,
and that other simpler classical optimization heuristics perform much better
for lattice-based factoring.
However, many topics in this area have interesting applications and
mathematical challenges, independently of factoring itself. We consider
particular cases of the CVP, and opportunities for applying quantum techniques
to other parts of the factorization pipeline, including the solution of linear
equations modulo 2. Though the goal of factoring 1000-bit numbers is still
out-of-reach, the combinatoric landscape is promising, and warrants further
research with more circumspect objectives
- …