Connecting colored point sets

DOI10.1016/j.dam.2006.06.010zbMath1108.68122OpenAlexW2087949901WikidataQ61732494 ScholiaQ61732494MaRDI QIDQ868381

Thomas Hackl, Clemens Huemer, Oswin Aichholzer, Franz Aurenhammer

Publication date: 2 March 2007

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.06.010

zbMATH Keywords

spanning treesbicolored point setcrossing properties

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Generalized Ramsey theory (05C55)

Related Items

A note on two geometric paths with few crossings for points labeled by integers in the plane ⋮ Non-crossing geometric steiner arborescences

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Problem-solving through problems
• On plane spanning trees and cycles of multicolored point sets with few intersections
• On the \(\Omega (n\log n)\) lower bound for convex hull and maximal vector determination
• Maintenance of configurations in the plane
• Intersection number of two connected geometric graphs
• Ramsey-type results for geometric graphs. I
• Triangulating point sets in space
• Triangulations without pointed spanning trees
• On graphs and rigidity of plane skeletal structures
• Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
• Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
• Planar minimally rigid graphs and pseudo-triangulations