Sciweavers

IJCGA
2006
79views more  IJCGA 2006»
13 years 11 months ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
IJCGA
2006
91views more  IJCGA 2006»
13 years 11 months ago
The Tsp and the Sum of its Marginal Values
This paper introduces a new notion related to the traveling salesperson problem (TSP) -the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal va...
Moshe Dror, Yusin Lee, James B. Orlin, Valentin Po...
IJCGA
2006
53views more  IJCGA 2006»
13 years 11 months ago
On the Rank Function of the 3-dimensional Rigidity Matroid
Bill Jackson, Tibor Jordán
IJCGA
2006
56views more  IJCGA 2006»
13 years 11 months ago
Computational Geometry Column 47
Joseph O'Rourke
IJCGA
2006
40views more  IJCGA 2006»
13 years 11 months ago
Minimum Area Convex Packing of Two Convex Polygons
Kai Tang, Charlie C. L. Wang, Danny Z. Chen
IJCGA
2006
81views more  IJCGA 2006»
13 years 11 months ago
Discrete Laplace-Beltrami Operator on Sphere and Optimal Spherical Triangulations
In this paper we first modify a widely used discrete Laplace Beltrami operator proposed by Meyer et al over triangular surfaces, and then establish some convergence results for th...
Guoliang Xu
IJCGA
2006
85views more  IJCGA 2006»
13 years 11 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...