Found: 8
Select item for more details and to access through your institution.
Polyhedra with Unguarded Interiors.
- Published in:
- International Journal of Computational Geometry & Applications, 2002, v. 12, n. 3, p. 173, doi. 10.1142/S0218195902000797
- By:
- Publication type:
- Article
On the Time Bound for Convex Decomposition of Simple Polygons.
- Published in:
- International Journal of Computational Geometry & Applications, 2002, v. 12, n. 3, p. 181, doi. 10.1142/S0218195902000803
- By:
- Publication type:
- Article
On Deletion in Delaunay Triangulations.
- Published in:
- International Journal of Computational Geometry & Applications, 2002, v. 12, n. 3, p. 193, doi. 10.1142/S0218195902000815
- By:
- Publication type:
- Article
Edge Advancing Rules for Intersecting Spherical Convex Polygons.
- Published in:
- International Journal of Computational Geometry & Applications, 2002, v. 12, n. 3, p. 207, doi. 10.1142/S0218195902000827
- By:
- Publication type:
- Article
An Optimal Morphing Between Polylines.
- Published in:
- International Journal of Computational Geometry & Applications, 2002, v. 12, n. 3, p. 217, doi. 10.1142/S0218195902000839
- By:
- Publication type:
- Article
Computing Roundness is Easy if the Set is Almost Round.
- Published in:
- International Journal of Computational Geometry & Applications, 2002, v. 12, n. 3, p. 229, doi. 10.1142/S0218195902000840
- By:
- Publication type:
- Article
Finding an Optimal Bridge Between Two Polygons.
- Published in:
- International Journal of Computational Geometry & Applications, 2002, v. 12, n. 3, p. 249, doi. 10.1142/S0218195902000852
- By:
- Publication type:
- Article
Computational Geometry Column 43.
- Published in:
- International Journal of Computational Geometry & Applications, 2002, v. 12, n. 3, p. 263, doi. 10.1142/S0218195902000864
- By:
- Publication type:
- Article