7,134 research outputs found

    Subset Warping: Rubber Sheeting with Cuts

    Full text link
    Image warping, often referred to as "rubber sheeting" represents the deformation of a domain image space into a range image space. In this paper, a technique is described which extends the definition of a rubber-sheet transformation to allow a polygonal region to be warped into one or more subsets of itself, where the subsets may be multiply connected. To do this, it constructs a set of "slits" in the domain image, which correspond to discontinuities in the range image, using a technique based on generalized Voronoi diagrams. The concept of medial axis is extended to describe inner and outer medial contours of a polygon. Polygonal regions are decomposed into annular subregions, and path homotopies are introduced to describe the annular subregions. These constructions motivate the definition of a ladder, which guides the construction of grid point pairs necessary to effect the warp itself

    Computing a Compact Spline Representation of the Medial Axis Transform of a 2D Shape

    Full text link
    We present a full pipeline for computing the medial axis transform of an arbitrary 2D shape. The instability of the medial axis transform is overcome by a pruning algorithm guided by a user-defined Hausdorff distance threshold. The stable medial axis transform is then approximated by spline curves in 3D to produce a smooth and compact representation. These spline curves are computed by minimizing the approximation error between the input shape and the shape represented by the medial axis transform. Our results on various 2D shapes suggest that our method is practical and effective, and yields faithful and compact representations of medial axis transforms of 2D shapes.Comment: GMP14 (Geometric Modeling and Processing

    MAP: Medial Axis Based Geometric Routing in Sensor Networks

    Get PDF
    One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consideration includes scalability, routing complexity, the length of the communication paths and the load sharing of the routes. In this paper, we show that a compact and expressive abstraction of network connectivity by the medial axis enables efficient and localized routing. We propose MAP, a Medial Axis based naming and routing Protocol that does not require locations, makes routing decisions locally, and achieves good load balancing. In its preprocessing phase, MAP constructs the medial axis of the sensor field, defined as the set of nodes with at least two closest boundary nodes. The medial axis of the network captures both the complex geometry and non-trivial topology of the sensor field. It can be represented compactly by a graph whose size is comparable with the complexity of the geometric features (e.g., the number of holes). Each node is then given a name related to its position with respect to the medial axis. The routing scheme is derived through local decisions based on the names of the source and destination nodes and guarantees delivery with reasonable and natural routes. We show by both theoretical analysis and simulations that our medial axis based geometric routing scheme is scalable, produces short routes, achieves excellent load balancing, and is very robust to variations in the network model

    Dense point sets have sparse Delaunay triangulations

    Full text link
    The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the worst case for all D = O(sqrt{n}). In particular, the Delaunay triangulation of any dense point set has linear complexity. We also generalize this upper bound to regular triangulations of k-ply systems of balls, unions of several dense point sets, and uniform samples of smooth surfaces. On the other hand, for any n and D=O(n), we construct a regular triangulation of complexity Omega(nD) whose n vertices have spread D.Comment: 31 pages, 11 figures. Full version of SODA 2002 paper. Also available at http://www.cs.uiuc.edu/~jeffe/pubs/screw.htm

    Semiclassical degeneracies and ordering for highly frustrated magnets in a field

    Full text link
    We discuss ground state selection by quantum fluctuations in frustrated magnets in a strong magnetic field. We show that there exist dynamical symmetries -- one a generalisation of Henley's gauge-like symmetry for collinear spins, the other the quantum relict of non-collinear weathervane modes -- which ensure a partial survival of the classical degeneracies. We illustrate these for the case of the kagome magnet, where we find zero-point energy differences to be rather small everywhere except near the collinear `up-up-down` configurations, where there is rotational but not translational symmetry breaking. In the effective Hamiltonian, we demonstrate the presence of a term sensitive to a topological `flux'. We discuss the connection of such problems to gauge theories by casting the frustrated lattices as medial lattices of appropriately chosen simplex lattices, and in particular we show how the magnetic field can be used to tune the physical sector of the resulting gauge theories.Comment: 10 pages, 8 figure
    corecore