Generalized sweep methods for parallel computational geometry

Michael T. Goodrich, Mujtaba R. Ghouse, Jonathan Bright · 1990

Article Generalized sweep methods for parallel computational geometry Share on Authors: M. Goodrich Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MD Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MDView Profile , M. Ghouse Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MD Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MDView Profile , J. Bright Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MD Dept. of Computer Science, The Johns Hopkins Univ., Baltimore, MDView Profile Authors Info & Claims SPAA '90: Proceedings of the second annual ACM symposium on Parallel algorithms and architecturesMay 1990 Pages 280–289https://doi.org/10.1145/97444.97695Online:01 May 1990Publication History 8citation405DownloadsMetricsTotal Citations8Total Downloads405Last 12 Months2Last 6 weeks0 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

Read the paper · More papers on PaperTik