scientific article; zbMATH DE number 6472653
From MaRDI portal
Publication:5501855
Cited in
(17)- The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets
- Temporal clustering
- Kinetic Polar Diagram
- Selecting distances in arrangements of hyperplanes spanned by points.
- Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\)
- Kinetic \(k\)-semi-Yao graph and its applications
- Indexing moving points
- On the complexity of time-dependent shortest paths
- A simple, faster method for kinetic proximity problems
- Dynamic proximity calculations for situation awareness
- scientific article; zbMATH DE number 7278033 (Why is no real title available?)
- Kinetic Euclidean minimum spanning tree in the plane
- A package for exact kinetic data structures and sweepline algorithms
- On incremental rendering of silhouette maps of a polyhedral scene
- Nonuniform SINR+Voronoi diagrams are effectively uniform
- Maintaining the extent of a moving point set
- Approximate $k$-Nearest Neighbor Graph on Moving Points
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501855)
