Result 1 to 20 of 607 total
A generalization of a theorem of Kleitman and Krieger. (English)
Int. J. Comput. Geom. Appl. 22, No. 2, 167-185 (2012).
1
Separability of point sets by $k$-level linear classification trees. (English)
Int. J. Comput. Geom. Appl. 22, No. 2, 143-166 (2012).
2
Linear-time 3-approximation algorithm for the $r$-star covering problem. (English)
Int. J. Comput. Geom. Appl. 22, No. 2, 103-142 (2012).
3
Approximate shortest homotopic paths in weighted regions. (English)
Int. J. Comput. Geom. Appl. 22, No. 1, 83-102 (2012).
4
$π/2$-angle Xao graphs are spanners. (English)
Int. J. Comput. Geom. Appl. 22, No. 1, 61-82 (2012).
5
Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space. (English)
Int. J. Comput. Geom. Appl. 22, No. 1, 45-60 (2012).
6
Computing the discrete Fréchet distance with imprecise input. (English)
Int. J. Comput. Geom. Appl. 22, No. 1, 27-44 (2012).
7
The onion diagram: a Voronoi-like tessellation of a planar line space and its applications. (English)
Int. J. Comput. Geom. Appl. 22, No. 1, 3-26 (2012).
8
Guest editors’ foreword. (English)
Int. J. Comput. Geom. Appl. 22, No. 1, 1-2 (2012).
9
Special issue: Selected papers based on the presentations at the 21st annual international symposium on algorithms and computation (ISAAC 2010), Jeju Island, South Korea, December 15‒17, 2010. (English)
Int. J. Comput. Geom. Appl. 22, No. 1, 102~p. (2012).
10
Multi cover of a polygon minimizing the sum of areas. (English)
Int. J. Comput. Geom. Appl. 21, No. 6, 685-698 (2011).
11
An approximation algorithm for locating maximal disks within convex polygons. (English)
Int. J. Comput. Geom. Appl. 21, No. 6, 661-684 (2011).
12
Centroid triangulations from $k$-sets. (English)
Int. J. Comput. Geom. Appl. 21, No. 6, 635-660 (2011).
13
Free-form surface partition in 3-d. (English)
Int. J. Comput. Geom. Appl. 21, No. 6, 609-634 (2011).
14
Geodesic disks and clustering in a simple polygon. (English)
Int. J. Comput. Geom. Appl. 21, No. 6, 595-608 (2011).
15
Extending the doubly linked face list for the representation of 2-pseudomanifolds and 2-manifolds with boundaries. (English)
Int. J. Comput. Geom. Appl. 21, No. 4, 467-494 (2011).
16
Shortest descending paths: towards an exact algorithm. (English)
Int. J. Comput. Geom. Appl. 21, No. 4, 431-466 (2011).
17
SimpliPoly: curvature-based polygonal curve simplification. (English)
Int. J. Comput. Geom. Appl. 21, No. 4, 417-429 (2011).
18
Inflating balls is NP-hard. (English)
Int. J. Comput. Geom. Appl. 21, No. 4, 403-415 (2011).
19
Catalog-based representation of 2D triangulations. (English)
Int. J. Comput. Geom. Appl. 21, No. 4, 393-402 (2011).
20
Result 1 to 20 of 607 total
Start
Contact
Print
General Help
