Simplified kinetic connectivity for rectangles and hypercubes

MaRDI QIDQ2768286zbMATH OpenFDO

Authors John Hershberger, Subhash Suri

Publication date 24 March 2002

zbMATH Keywords

kinetic data structure

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Kinetic connectivity for unit disks
• Dynamic Connectivity for Axis-Parallel Rectangles
• Dynamic connectivity for axis-parallel rectangles
• Dynamic connectivity: connecting to networks and geometry
• Kinetic convex hulls, Delaunay triangulations and connectivity structures in the black-box model

Cited in

(6)

• Dynamic connectivity for axis-parallel rectangles
• Multiple-SLE _κ connectivity weights for rectangles, hexagons, and octagons
• Dynamic Connectivity for Axis-Parallel Rectangles
• Kinetic connectivity for unit disks
• Kinetic and dynamic data structures for convex hulls and upper envelopes
• Kinetic facility location

This page was built for publication: Simplified kinetic connectivity for rectangles and hypercubes

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