2,641 research outputs found

    Separation-Sensitive Collision Detection for Convex Objects

    Full text link
    We develop a class of new kinetic data structures for collision detection between moving convex polytopes; the performance of these structures is sensitive to the separation of the polytopes during their motion. For two convex polygons in the plane, let DD be the maximum diameter of the polygons, and let ss be the minimum distance between them during their motion. Our separation certificate changes O(log(D/s))O(\log(D/s)) times when the relative motion of the two polygons is a translation along a straight line or convex curve, O(D/s)O(\sqrt{D/s}) for translation along an algebraic trajectory, and O(D/s)O(D/s) for algebraic rigid motion (translation and rotation). Each certificate update is performed in O(log(D/s))O(\log(D/s)) time. Variants of these data structures are also shown that exhibit \emph{hysteresis}---after a separation certificate fails, the new certificate cannot fail again until the objects have moved by some constant fraction of their current separation. We can then bound the number of events by the combinatorial size of a certain cover of the motion path by balls.Comment: 10 pages, 8 figures; to appear in Proc. 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 1999; see also http://www.uiuc.edu/ph/www/jeffe/pubs/kollide.html ; v2 replaces submission with camera-ready versio

    Mobile vs. point guards

    Get PDF
    We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using "rectangular vision". We prove a sharp bound on the minimum number of point guards required to cover the gallery in terms of the minimum number of vertical mobile guards and the minimum number of horizontal mobile guards required to cover the gallery. Furthermore, we show that the latter two numbers can be calculated in linear time.Comment: This version covers a previously missing case in both Phase 2 &

    Broadcasting Automata and Patterns on Z^2

    Get PDF
    The Broadcasting Automata model draws inspiration from a variety of sources such as Ad-Hoc radio networks, cellular automata, neighbourhood se- quences and nature, employing many of the same pattern forming methods that can be seen in the superposition of waves and resonance. Algorithms for broad- casting automata model are in the same vain as those encountered in distributed algorithms using a simple notion of waves, messages passed from automata to au- tomata throughout the topology, to construct computations. The waves generated by activating processes in a digital environment can be used for designing a vari- ety of wave algorithms. In this chapter we aim to study the geometrical shapes of informational waves on integer grid generated in broadcasting automata model as well as their potential use for metric approximation in a discrete space. An explo- ration of the ability to vary the broadcasting radius of each node leads to results of categorisations of digital discs, their form, composition, encodings and gener- ation. Results pertaining to the nodal patterns generated by arbitrary transmission radii on the plane are explored with a connection to broadcasting sequences and ap- proximation of discrete metrics of which results are given for the approximation of astroids, a previously unachievable concave metric, through a novel application of the aggregation of waves via a number of explored functions
    corecore