Found: 6
Select item for more details and to access through your institution.
Computing an Almost Minimum Set of Spanning Line Segments of a Polyhedron.
- Published in:
- International Journal of Computational Geometry & Applications, 2001, v. 11, n. 5, p. 475, doi. 10.1142/S0218195901000602
- By:
- Publication type:
- Article
Constructing a Strongly Convex Superhull of Points.
- Published in:
- International Journal of Computational Geometry & Applications, 2001, v. 11, n. 5, p. 487, doi. 10.1142/S0218195901000614
- By:
- Publication type:
- Article
The L[sub ∞] Voronoi Diagram of Segments and VLSI Applications.
- Published in:
- International Journal of Computational Geometry & Applications, 2001, v. 11, n. 5, p. 503, doi. 10.1142/S0218195901000626
- By:
- Publication type:
- Article
Searching a Polygonal Region from the Boundary.
- Published in:
- International Journal of Computational Geometry & Applications, 2001, v. 11, n. 5, p. 529, doi. 10.1142/S0218195901000638
- By:
- Publication type:
- Article
The Shuffling Buffer.
- Published in:
- International Journal of Computational Geometry & Applications, 2001, v. 11, n. 5, p. 555, doi. 10.1142/S021819590100064X
- By:
- Publication type:
- Article
Computational Geometry Column 42.
- Published in:
- International Journal of Computational Geometry & Applications, 2001, v. 11, n. 5, p. 573, doi. 10.1142/S0218195901000651
- By:
- Publication type:
- Article