Sciweavers

19 search results - page 1 / 4
» Accurate Minkowski sum approximation of polyhedral models
Sort
View
CVGIP
2006
107views more  CVGIP 2006»
13 years 6 months ago
Accurate Minkowski sum approximation of polyhedral models
Gokul Varadhan, Dinesh Manocha
PG
2007
IEEE
14 years 14 days ago
Point-Based Minkowski Sum Boundary
Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to...
Jyh-Ming Lien
CGF
2010
146views more  CGF 2010»
13 years 6 months ago
Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes
We present a novel technique for the efficient boundary evaluation of sweep operations applied to objects in polygonal boundary representation. These sweep operations include Mink...
Marcel Campen, Leif Kobbelt
COMPGEOM
2011
ACM
12 years 9 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
INFOCOM
2007
IEEE
14 years 15 days ago
Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
Jian Ni, Sekhar Tatikonda