Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model

DOI10.20382/JOCG.V3I1A11zbMATH Open1404.68200OpenAlexW2152311167MaRDI QIDQ2968093FDOQ2968093

Authors: Marcel Roeloffzen, Bettina Speckmann, Mark de Berg 

Publication date: 9 March 2017

Full work available at URL: https://doaj.org/article/27e2a48d0c2a4e3da7cddb46f8a6b7cf

Recommendations

• Kinetic convex hulls and Delaunay triangulations in the black-box model
• Algorithms and Data Structures
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• A kinetic triangulation scheme for moving points in the plane
• A kinetic triangulation scheme for moving points in the plane

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Cited In (6)

• A frequency-competitive query strategy for maintaining low collision potential among moving entities
• Kinetic compressed quadtrees in the black-box model with applications to collision detection for low-density scenes
• A sensor-based framework for kinetic data compression
• Simplified kinetic connectivity for rectangles and hypercubes
• Robust Kinetic Convex Hulls in 3D
• Minimizing query frequency to bound congestion potential for moving entities at a fixed target time

This page was built for publication: Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model

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