Skip to search formSkip to main contentSkip to account menu

Kinetic triangulation

A Kinetic Triangulation data structure is a kinetic data structure that maintains a triangulation of a set of moving points. Maintaining a kinetic… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Convex hullDelaunay triangulationKinetic data structureList of numerical analysis topics

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
An Automated Avoidance Approach for Multiple General-Aviation Conflicts
Air traffic controllers (ATC) face daily major concerns which are controlled Airspace (CAS) infringements. An infringement is… 
2015
2015
Stable Delaunay Graphs
Let P be a set of n points in R2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts… 
2010
2010
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure… 
2006
2006
A Two-Dimensional Kinetic Triangulation with Near-Quadratic Topological Changes
A triangulation of a set S of points in the plane is a subdivision of the convex hull of S into triangles whose vertices are… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)