First Page | Meta Content | |
---|---|---|
![]() | Document Date: 2004-04-09 17:15:20Open Document File Size: 1,10 MBShare Result on FacebookCityBern / /CompanyElsevier Science B.V. / ESPRIT / /CountryFrance / United States / Israel / /Currencypence / / /FacilityLibrary of Efficient Data-structures / Tel Aviv University / Duke University / /IndustryTermquad-tree based approximation algorithms / minimum convex decomposition algorithm / arrangement algorithm / union algorithm / dynamic programming algorithm / naïve solution / motion planning software / decomposition algorithms / software library / union algorithms / incremental algorithm / min-convex decomposition algorithm / minimal-maximum-degree algorithm / manufacturing / naïve triangulation algorithm / search structure / incremental union algorithm / sum algorithms / /OperatingSystemLinux / /OrganizationIsraeli Binational Science Foundation / Center for Geometric Computing / National Science Foundation / Israel Science Foundation / Minerva Center for Geometry / Tel Aviv University / Tel-Aviv / Duke University / Durham / School of Computer Science / Department of Computer Science / Israel Academy of Sciences and Humanities / Israeli Ministry of Science / /PersonPankaj K. Agarwal / Dan Halperin / / /PositionCorresponding author / /ProgrammingLanguageVisual C++ / /Technologyminimum convex decomposition algorithm / three algorithms / RAM / Minkowski algorithm / Linux / arrangement algorithm / incremental union algorithm / ESA / quad-tree based approximation algorithms / Minkowski-sum algorithms / min-convex decomposition algorithm / AB algorithm / Minkowski sum algorithms / union algorithms / union algorithm / 61 Incremental union algorithm / CAD/CAM / decomposition algorithms / dynamic programming algorithm / minimal-maximum-degree algorithm / naïve triangulation algorithm / incremental algorithm / /URLwww.elsevier.com/locate/comgeo / http /SocialTag |