Showing results 16 to 25 of 25
< previous
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
On greedy tetrahedralization of points in 3D Proceeding/Conference:Proceedings of the Fifth International Symposium on Algorithms and Computation (ISAAC) | 1994 | 106 | ||
On Hamiltonian Tetrahedrlization of Convex Polyhedra Proceeding/Conference:The 5th International Symposium on Operations Research and Its Applications (ISORA 2005) | 2005 | 87 | ||
On the difficulty of greedy tetrahedralization of points in 3-D Proceeding/Conference:Proceedings of the 7th Canadian Conference on Computational Geometry, Quebec, Canada | 1995 | 92 | ||
Opitmal intersection problem of two networks Proceeding/Conference:Proceedings of the INFORMS International 2001 Hawaii (Institute for Operations Research and the Management Sciences) | 2001 | 84 | ||
Optimal intersection problem of two networks Proceeding/Conference:INFORMS International 2001 Hawaii | 2001 | |||
A Parallel Algorithm for Finding the Constrained Voronoi Diagram of Line Segments in the Plane Proceeding/Conference:Proceedings of the 6th International Workshop, WADS'99 | 1999 | |||
Progress on maximum weight triangulation Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004 | 89 | ||
Triangulations without Minimum-Weight Drawing Proceeding/Conference:Proceedings on the 4th Italian Conference on Algorithms and Complexity (CIAC'2000) | 2000 | 116 | ||
Triangulations without minimum-weight drawing Journal:Information Processing Letters | 2000 | 189 | ||
A unifying approach for a class of problems in the computational geometry of polygons Journal:The Visual Computer | 1985 | 109 |