A minimum-vertex triangulation
نویسندگان
چکیده
منابع مشابه
On a vertex-minimal triangulation of RP
We give three constructions of a vertex-minimal triangulation of 4-dimensional real projective space RP4. The first construction describes a 4-dimensional sphere on 32 vertices, which is a double cover of a triangulated RP4 and has a large amount of symmetry. The second and third constructions illustrate approaches to improving the known number of vertices needed to triangulate n-dimensional re...
متن کاملOn Making a Distinguished Vertex Minimum Degree by Vertex Deletion
For directed and undirected graphs, we study the problem to make a distinguished vertex the unique minimum-(in)degree vertex through deletion of a minimum number of vertices. The corresponding NP-hard optimization problems are motivated by applications concerning control in elections and social network analysis. Continuing previous work for the directed case, we show that the problem is W[2]-ha...
متن کاملMinimum Weight Triangulation by Cutting Out Triangles
We describe a fixed parameter algorithm for computing the minimum weight triangulation (MWT) of a simple polygon with (n− k) vertices on the perimeter and k hole vertices in the interior, that is, for a total of n vertices. Our algorithm is based on cutting out empty triangles (that is, triangles not containing any holes) from the polygon and processing the parts or the rest of the polygon recu...
متن کاملEfficient Approximation for Triangulation of Minimum Treewidth
Finding triangulations of minimum treewidth for graphs is central to many problems in computer science. Real-world problems in artificial intelligence, VLSI design and databases are efficiently solvable if we have an efficient approximation algorithm for this problem. In this paper we present a simple approximation algorithm for finding triangulations of minimum treewidth. The algorithm produce...
متن کاملApproximating the Minimum Weight Steiner Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtrees. In O(n log n) time we can compute a triangulation with O(n) new points, and no obtuse triangles, that approximates the MWST. We can also approximate the MWST with triangulations having no sharp angles. We generali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1978
ISSN: 0095-8956
DOI: 10.1016/0095-8956(78)90043-6