On minimum and maximum spanning trees of linearly moving points

DOI10.1007/BF02574035zbMath0815.68118OpenAlexW2094982244MaRDI QIDQ1346135

Takeshi Tokuyama, Kazuo Iwano, Naoki Katoh

Publication date: 20 March 1995

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131353

zbMATH Keywords

motion planningroboticsspanning treescomputational geometry problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (8)

The Minimum Moving Spanning Tree Problem ⋮ Cross-sections of line configurations in \(\mathbb{R}^3\) and (\(d-2\))-flat configurations in \(\mathbb{R}^d\) ⋮ PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS ⋮ PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS ⋮ Directional Geometric Routing on Mobile Ad Hoc Networks ⋮ Bisecting three classes of lines ⋮ A simple, faster method for kinetic proximity problems ⋮ Structural tolerance and Delaunay triangulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing Euclidean maximum spanning trees
• Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
• Some dynamic computational geometry problems
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• On the number of minimal 1-Steiner trees
• VORONOI DIAGRAMS OF MOVING POINTS IN THE PLANE
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED

This page was built for publication: On minimum and maximum spanning trees of linearly moving points