Connecting colored point sets

DOI10.1016/J.DAM.2006.06.010MaRDI QIDQ868381zbMATH OpenOpenAlexDBLPWikidataFDO

Authors T. 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)

Recommendations

• Coloring copoints of a planar point set
• From connectivity to coloring
• Coloring points with respect to squares
• Coloring points with respect to squares
• Colouring the triangles determined by a point set
• The union of colorful simplices spanned by a colored point set
• The union of colorful simplices spanned by a colored point set
• Separating Points and Coloring Principles
• Matching colored points with rectangles
• Connected sequential colourings

Cites work

• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 2188414 (Why is no real title available?)
• Intersection number of two connected geometric graphs
• Maintenance of configurations in the plane
• On graphs and rigidity of plane skeletal structures
• On plane spanning trees and cycles of multicolored point sets with few intersections
• On the (n n) lower bound for convex hull and maximal vector determination
• Planar minimally rigid graphs and pseudo-triangulations
• Problem-solving through problems
• Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
• Ramsey-type results for geometric graphs. I
• Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
• Triangulating point sets in space
• Triangulations without pointed spanning trees

Cited in

(7)

• Combinatorial Geometry and Graph Theory
• On the red/blue spanning tree problem
• On plane spanning trees and cycles of multicolored point sets with few intersections
• Intersection number of two connected geometric graphs
• Geometric spanning cycles in bichromatic point sets
• Non-crossing geometric Steiner arborescences
• A note on two geometric paths with few crossings for points labeled by integers in the plane

Describes a project that uses

Uses Software

• Voronoi

This page was built for publication: Connecting colored point sets

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