Thick non-crossing paths and minimum-cost flows in polygonal domains
Valentin Polishchuk, Joseph S. B. Mitchell · 2007
Article Share on Thick non-crossing paths and minimum-cost flows in polygonal domains Authors: Valentin Polishchuk Helsinki Institute for Information Technology, Helsinki, Finland Helsinki Institute for Information Technology, Helsinki, FinlandView Profile , Joseph S.B. Mitchell Stony Brook University, Stony Brook, NY Stony Brook University, Stony Brook, NYView Profile Authors Info & Claims SCG '07: Proceedings of the twenty-third annual symposium on Computational geometryJune 2007 Pages 56–65https://doi.org/10.1145/1247069.1247079Online:06 June 2007Publication History 17citation292DownloadsMetricsTotal Citations17Total Downloads292Last 12 Months6Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access