A kinetic triangulation scheme for moving points in the plane

DOI10.1016/J.COMGEO.2010.11.001MaRDI QIDQ632719zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Natan Rubin, Micha Sharir

Publication date 25 March 2011

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2010.11.001

zbMATH Keywords

kinetic data structurepseudo-triangulationtreaps

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• A kinetic triangulation scheme for moving points in the plane
• A 2D kinetic triangulation with near-quadratic topological changes
• A two-dimensional kinetic triangulation with near-quadratic topological changes
• On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
• Algorithms and Data Structures

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 3852561 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 732977 (Why is no real title available?)
• scientific article; zbMATH DE number 1501063 (Why is no real title available?)
• scientific article; zbMATH DE number 1795894 (Why is no real title available?)
• scientific article; zbMATH DE number 219238 (Why is no real title available?)
• A two-dimensional kinetic triangulation with near-quadratic topological changes
• Applications of random sampling in computational geometry. II
• Data Structures for Mobile Data
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• Kinetic and dynamic data structures for closest pair and all nearest neighbors
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Kinetic collision detection between two simple polygons.
• Kinetic stable Delaunay graphs
• Maintenance of configurations in the plane
• Randomized search trees
• Ray shooting in polygons using geodesic triangulations
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE

Cited in

(13)

• Weak 1r-nets for moving points
• Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
• Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model
• A kinetic triangulation scheme for moving points in the plane
• Tracking a moving point in the plane
• Lower bounds for kinetic planar subdivisions
• Kinetic mesh refinement in 2D
• A two-dimensional kinetic triangulation with near-quadratic topological changes
• On kinetic Delaunay triangulations: a near-quadratic bound for unit speed motions
• Stable Delaunay graphs
• A novel video compression scheme based on kinetic Delaunay triangulation
• A 2D kinetic triangulation with near-quadratic topological changes
• Kinetic connectivity for unit disks

This page was built for publication: A kinetic triangulation scheme for moving points in the plane

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632719)