Showing 1–20 of 87 results
/ Date/ Name
Apr 8, 2020Computing Convex Partitions for Point Sets in the Plane: The CG:SHOP Challenge 2020Aug 28, 2001Computational Geometry Column 42Sep 30, 2002An Algorithmic Study of Manufacturing Paperclips and Other Folded StructuresOct 26, 2002The Lazy Bureaucrat Scheduling ProblemSep 9, 2003Optimal Covering Tours with Turn CostsApr 7, 2020Probing a Set of Trajectories to Maximize Captured InformationNov 14, 2021Area-Optimal Simple Polygonalizations: The CG Challenge 2019Mar 5, 2017Approximation algorithms for TSP with neighborhoods in the planeMar 5, 2017A PTAS for TSP with Neighborhoods Among Fat Regions in the PlaneFeb 18, 2004The Freeze-Tag Problem: How to Wake Up a Swarm of RobotsJun 11, 2002On Simultaneous Graph EmbeddingDec 10, 2002Algorithms for Rapidly Dispersing Robot Swarms in Unknown EnvironmentsNov 8, 2015Improved Approximation Algorithms for Relay PlacementMay 4, 2011Connecting a Set of Circles with Minimum Sum of RadiiFeb 14, 2023Minimum-link $C$-Oriented Paths Visiting a Sequence of Regions in the PlaneOct 15, 2003On the continuous Fermat-Weber problemMar 23, 2016Computing Nonsimple Polygons of Minimum PerimeterMar 19, 2016Geometric Hitting Set for Segments of Few OrientationsFeb 13, 2013Minimum-Link Paths RevisitedApr 4, 2006Minimum-Cost Coverage of Point Sets by Disks