Sciweavers

285 search results - page 45 / 57
» Steaming on Convex Hulls
Sort
View
SMI
2005
IEEE
117views Image Analysis» more  SMI 2005»
14 years 1 months ago
Contouring 1- and 2-Manifolds in Arbitrary Dimensions
We propose an algorithm for contouring k-manifolds (k = 1, 2) embedded in an arbitrary n-dimensional space. We assume (n−k) geometric constraints are represented as polynomial e...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
ESA
2004
Springer
117views Algorithms» more  ESA 2004»
14 years 24 days ago
Classroom Examples of Robustness Problems in Geometric Computations
The algorithms of computational geometry are designed for a machine model with exact real arithmetic. Substituting floating-point arithmetic for the assumed real arithmetic may c...
Lutz Kettner, Kurt Mehlhorn, Sylvain Pion, Stefan ...
IMR
2004
Springer
14 years 24 days ago
Entkerner: A System for Removal of Globally Invisible Triangles from Large Meshes
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
Manfred Ernst, Frank Firsching, Roberto Grosso
INFOCOM
2002
IEEE
14 years 10 days ago
Clock Synchronization Algorithms for Network Measurements
Abstract—Packet delay traces are important measurements for analyzing end-to-end performance and for designing traffic control algorithms in computer networks. Due to the fact t...
Li Zhang, Zhen Liu, Cathy H. Xia
ISVC
2009
Springer
14 years 6 hour ago
Deformable Proximity Queries and Their Application in Mobile Manipulation Planning
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
Marc Gissler, Christian Dornhege, Bernhard Nebel, ...