Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions

From MaRDI portal
Publication:1809513

DOI10.1007/PL00009479zbMath0946.68147WikidataQ59649965 ScholiaQ59649965MaRDI QIDQ1809513

David Eppstein, Jeff Erickson

Publication date: 17 October 2000

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




Related Items

A FAST STRAIGHT-SKELETON ALGORITHM BASED ON GENERALIZED MOTORCYCLE GRAPHSStraight skeletons and mitered offsets of nonconvex polytopesOPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONSRealistic roofs over a rectilinear polygonRandom exploration of the procedural space for single-view 3D modeling of buildingsLinear transformation distance for bichromatic matchingsComputing positively weighted straight skeletons of simple polygons based on a bisector arrangementEmanation graph: a plane geometric spanner with Steiner pointsCONSTRUCTING THE CITY VORONOI DIAGRAM FASTERKinetic collision detection between two simple polygons.Straight Skeletons of Three-Dimensional PolyhedraA faster algorithm for computing motorcycle graphsA simple algorithm for computing positively weighted straight skeletons of monotone polygonsMin-/Max-Volume Roofs Induced by Bisector Graphs of Polygonal Footprints of BuildingsImplementing straight skeletons with exact arithmetic: challenges and experiencesRealistic roofs without local minimum edges over a rectilinear polygonCapturing crossings: convex hulls of segment and plane intersectionsWeighted straight skeletons in the planePlanar Matchings for Weighted Straight SkeletonsPlanar Matchings for Weighted Straight SkeletonsCrushing Disks EfficientlyVector-Based Morphological Operations on Polygons Using Straight Skeletons for Digital PathologyRecognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their InputReprint of: Weighted straight skeletons in the planeOrder-\(k\) \(\alpha\)-hulls and \(\alpha\)-shapes




This page was built for publication: Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions