Showing results 1 to 20 of 25
next >
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
Algorithms and Complexity for Tetrahedralization Detections Proceeding/Conference:The 13th International Symposium on Algorithms and Computation (ISAAC 2002) | 2002 | 129 | ||
Approximation Algorithms for Some Optimal 2D and 3D Triangulations Book:Handbook on Approximation Algorithms and Metaheuristics | 2006 | 112 | ||
Approximation for minimum triangulation of convex polyhedra Proceeding/Conference:Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms | 2001 | 88 | ||
Approximation for minimum triangulations of simplicial convex 3-polytopes Journal:Discrete and Computanional Geometry | 2001 | 102 | ||
Construction of the Nearest Neighbor Embracing Graph of a Point Set Proceeding/Conference:The 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004) | 2004 | 117 | ||
Construction of the nearest neighbor embracing graph of a point set Journal:Journal of Combinatorial Optimization | 2006 | 98 | ||
Construction of the nearest neighbor embracing graph of a point set Journal:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2004 | 120 | ||
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time Proceeding/Conference:Proceedings of the Third Annual European Symposium on Algorithms- ESA '95, Springer Verlag Lecture Notes in Computer Science 979, Corfu, Greece | 1995 | 110 | ||
Finding the Media Axis of a Simple Polygon in Linear Time Journal:Discrete & Computational Geometry | 1999 | 118 | ||
Finding the medial axis of a simple polygon in linear time Proceeding/Conference:Proceedings of the 6th International Symposium on Algorithms and Computation (ISAAC '95), Cairns, Australia, Lecture Notes in Computer Science 1004 | 1995 | 91 | ||
Maximum Stabbing Line in 2D Plane Proceeding/Conference:Proceedings of the 5th Annual International Computing and Combinatorics Conference (COCOON'99) | 1999 | 95 | ||
Maximum weight triangulation and graph drawing Journal:Information Processing Letters | 1999 | 98 | ||
Maximum Weight Triangulation and Graph Drawing Proceeding/Conference:Proceedings of the 6th International Symposium on Graph Drawing (GD'98) | 1998 | 110 | ||
Maximum Weight Triangulation and its Application on Graph Drawing Proceeding/Conference:Proceedings of the Fourth Annual International Conference on Computing and Combinatorics (COCOON'98) | 1998 | 85 | ||
A new subgraph of minimum weight triangulations Proceeding/Conference:Proceedings of 7th International Symposium on Algorithms and Computation (ISAAC) | 1996 | 124 | ||
On greedy tetrahedralization of points in 3D Proceeding/Conference:Proceedings of the Fifth International Symposium on Algorithms and Computation (ISAAC) | 1994 | 98 | ||
On Hamiltonian Tetrahedrlization of Convex Polyhedra Proceeding/Conference:The 5th International Symposium on Operations Research and Its Applications (ISORA 2005) | 2005 | 81 | ||
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 | 83 | ||
Opitmal intersection problem of two networks Proceeding/Conference:Proceedings of the INFORMS International 2001 Hawaii (Institute for Operations Research and the Management Sciences) | 2001 | 71 | ||
Optimal intersection problem of two networks Proceeding/Conference:INFORMS International 2001 Hawaii | 2001 | 68 |