Results 1  10
of
26
Competitive Online Routing in Geometric Graphs
 Theoretical Computer Science
, 2001
"... We consider online routing algorithms for finding paths between the vertices of plane graphs. ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
We consider online routing algorithms for finding paths between the vertices of plane graphs.
Algorithms for Moving Objects Databases
"... Whereas earlier work on spatiotemporal databases generally focused on geometries changing in discrete steps, the emerging area of moving objects databases supports geometries changing continuously. Two important abstractions are moving point and moving region, modeling objects for which only the ti ..."
Abstract

Cited by 34 (10 self)
 Add to MetaCart
Whereas earlier work on spatiotemporal databases generally focused on geometries changing in discrete steps, the emerging area of moving objects databases supports geometries changing continuously. Two important abstractions are moving point and moving region, modeling objects for which only the timedependent position, or also the shape and extent are relevant, respectively. Examples of the first kind of moving entity are all kinds of vehicles, aircraft, people, or animals; of the latter hurricanes, forest res, forest growth, or oil spills in the sea. The goal is to develop data models and query languages as well as DBMS implementations supporting such entities, enabling new kinds of database applications. In earlier work we have proposed an approach based on abstract data types. Hence, moving point or moving region are viewed as data types with suitable operations. For example, a moving point might be projected into the plane, yielding a curve, or a moving region be mapped to a function describing the development of its size, yielding a realvalued function. A careful design of a system of types and operations (an algebra) has been presented, emphasizing completeness, closure, consistency and genericity. This design was given at an abstract level, defining, for example, geometries in terms of infinite point sets. In the next step, a discrete model was presented, o ering nite representations and data structures for all the types of the abstract model. The present paper provides the final step towards implementation by studying and developing systematically algorithms for (a large subset of) the operations. Some of them are relatively straightforward; others are quite complex. Algorithms are meant to be used in a database context; we also address...
How to Find a Point on a Line within a Fixed Distance
, 1998
"... It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in the worst case. This competitive factor of 9 is optimal. We investigate the case where the target is known to be within a ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
It is well known that on a line, a target point in unknown position can be found by walking a path at most 9 times as long as the distance from the start to the target point, in the worst case. This competitive factor of 9 is optimal. We investigate the case where the target is known to be within a fixed distance, r, of the start point, and determine the optimum competitive factor, C(r) < 9, that can be achieved by a competitive strategy S(r), under this additional assumption.
Geometric Construction of the LeviCivita Parallelism
 THEORY AND APPL. OF CATEGORIES
, 1998
"... In terms of synthetic differential geometry, we give a variational characterization of the connection (parallelism) associated to a pseudoRiemannian metric on a manifold. ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
In terms of synthetic differential geometry, we give a variational characterization of the connection (parallelism) associated to a pseudoRiemannian metric on a manifold.
The Ultimate Strategy to Search on m Rays?
 In Proceedings of the 4th International Conference on Computing and Combinatorics (COCOON'98
, 1998
"... We consider the problem of searching on m current rays for a target of unknown location. If no upper bound on the distance to the target is known in advance, then the optimal competitive ratio is 1 + 2m m =(m 1) m 1 . We show that if an upper bound of D on the distance to the target is known in ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We consider the problem of searching on m current rays for a target of unknown location. If no upper bound on the distance to the target is known in advance, then the optimal competitive ratio is 1 + 2m m =(m 1) m 1 . We show that if an upper bound of D on the distance to the target is known in advance, then the competitive ratio of any search strategy is at least 1 + 2m m =(m 1) m 1 O(1= log 2 D) which is again optimalbut in a stricter sense. To show the optimality of our lower bound we construct a search strategy that achieves this ratio. Surprisingly, our strategy does not need to know an upper bound on the distance to the target in advance; it achieves a competitive ratio of 1 + 2m m =(m 1) m 1 O(1= log 2 D) if the target is found at distance D. Finally, we also present an algorithm to compute the strategy that allows the robot to search the farthest for a given competitive ratio C. 1 Introduction Searching for a target is an important and well studied problem i...
Competitive Online Approximation of the Optimal Search Ratio
 In Proc. 12th Annu. European Sympos. Algorithms, volume 3221 of Lecture Notes Comput. Sci
, 2004
"... How e#ciently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple polygons and for general graphs, by providing online search strategies that are as good as the best o#ine search algorithm ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
How e#ciently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple polygons and for general graphs, by providing online search strategies that are as good as the best o#ine search algorithms, up to a constant factor. For other settings we prove that no such online algorithms exist.
One Sided Error Predicates in Geometric Computing
 Proc. 15th IFIP World Computer Congress, Fundamentals  Foundations of Computer Science
, 1998
"... A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicates, such as orientation or incircletests, this allows efficient floating point implementations of the predicates with ra ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A conservative implementation of a predicate returns true only if the exact predicate is true. That is, we accept a one sided error for the implementation. For geometric predicates, such as orientation or incircletests, this allows efficient floating point implementations of the predicates with rare occurrences of the one sided error. We discuss the use of such conservative implementations for convex hull and triangulation algorithms for point sets in the plane. The resulting programs show a minor slowdown compared to an implementation that completely ignores the finite precision issue. However, our programs always produce output that satisfies basic desirable properties. The output can be easily checked for correctness and  if necessary  it can be repaired with an exact implementation of the needed predicates. Although (or since?) conservative implementations of predicates cannot detect degeneracies, the programs work for degenerate input. In fact, in our experiments the advanta...
Supportedness and Tameness: Differentialless Geometry of Plane Curves
 Pattern Recognition
, 1998
"... We introduce a class of planar arcs and curves, called tame arcs, which is general enough to describe (parts of) the boundaries of planar real objects. A tame arc can have a smooth parts as well as sharp (nondifferentiable) corners. Thus, a polygonal arc is tame. On the other hand, this class of ar ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We introduce a class of planar arcs and curves, called tame arcs, which is general enough to describe (parts of) the boundaries of planar real objects. A tame arc can have a smooth parts as well as sharp (nondifferentiable) corners. Thus, a polygonal arc is tame. On the other hand, this class of arcs is restrictive enough to rule out pathological arcs which have infinitely many inflections or which turn infinitely often: A tame arc can have only finitely many inflections, and its total absolute turn must be finite.
Java Applets for the Dynamic Visualization of Voronoi Diagrams
, 2003
"... This paper is dedicated to Thomas Ottmann on the occasion of his 60th birthday. We discuss the design of several Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying distance function is changed ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper is dedicated to Thomas Ottmann on the occasion of his 60th birthday. We discuss the design of several Java applets that visualize how the Voronoi diagram of n points continuously changes as individual points are moved across the plane, or as the underlying distance function is changed. Moreover, we report on some experiences made in using these applets in teaching and research. The applets can be found and tried out at http://wwwpi6.fernunihagen.de/GeomLab/.