Sciweavers

2188 search results - page 13 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
IJCAI
2003
13 years 10 months ago
Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
Christophe Jermann, Bertrand Neveu, Gilles Trombet...
COMPGEOM
2009
ACM
14 years 3 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir
JNW
2007
104views more  JNW 2007»
13 years 8 months ago
A Distributed Graph Algorithm for Geometric Routing in Ad Hoc Wireless Networks
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...
Rashid Bin Muhammad
MICCAI
2003
Springer
14 years 9 months ago
Relative Performance of Geometric Search Algorithms for Interpolating Unstructured Mesh Data
Abstract. Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating poin...
Mahdieh Khoshniat, Gordan R. Stuhne, David A. Stei...
CAD
2005
Springer
13 years 8 months ago
Geometric algorithms for rapidly reconfigurable mold manufacturing of free-form objects
This paper presents geometric algorithms for developing a re-configurable tooling system for fabrication of freeform objects. The proposed method involves a mold block, with n fac...
Aditya Kelkar, Rakesh Nagi, Bahattin Koc