Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Algorithms and Complexity for Tetrahedralization Detections
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
A quasi-polynomial time approximation scheme for minimum weight triangulation
Journal of the ACM (JACM)
Use of the TRIPOD overlay network for resource discovery
Future Generation Computer Systems
Near-optimal multicriteria spanner constructions in wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
On a linear program for minimum-weight triangulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Triangulations with circular arcs
GD'11 Proceedings of the 19th international conference on Graph Drawing
Counting crossing-free structures
Proceedings of the twenty-eighth annual symposium on Computational geometry
Fundamenta Informaticae - Emergent Computing
A simple aggregative algorithm for counting triangulations of planar point sets and related problems
Proceedings of the twenty-ninth annual symposium on Computational geometry
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics
ACM Transactions on Sensor Networks (TOSN)
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.00 |
A set, V, of points in the plane is triangulated by a subset T, of the straight-line segments whose endpoints are in V, if T is a maximal subset such that the line segments in T intersect only at their endpoints. The weight of any triangulation is the sum of the Euclidean lengths of the line segments in the triangulation. We examine two problems involving triangulations. We discuss the problem of finding a minimum weight triangulation among all triangulations of a set of points and give counterexamples to two published solutions to this problem. Secondly, we show that the problem of determining the existence of a triangulation, in a given subset of the line segments whose endpoints are in V, is NP-Complete.