Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

77

COMGEO
2008
ACM

69views Applied Computing» more COMGEO 2008»

Triangulations without pointed spanning trees

15 years 2 months ago

Triangulations without pointed spanning trees

Download www.ist.tugraz.at

Oswin Aichholzer, Clemens Huemer, Hannes Krasser

Real-time Traffic

Applied Computing | COMGEO 2008 |

claim paper

Related Content

» Efficient minimum spanning tree construction without Delaunay triangulation

» An almost fourapproximation algorithm for maximum weight triangulation

» Minimizing the stabbing number of matchings trees and triangulations

» Bounds on the maximum multiplicity of some common geometric graphs

» NarrowShallowLowLight Trees with and without Steiner Points

» Minimum Spanning Tree Based Clustering Algorithms

» A LinearTime Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon

» Maximizing Maximal Angles for Plane StraightLine Graphs

» Minimum weight convex Steiner partitions

Post Info
More Details (n/a)

Added	09 Dec 2010
Updated	09 Dec 2010
Type	Journal
Year	2008
Where	COMGEO
Authors	Oswin Aichholzer, Clemens Huemer, Hannes Krasser

Comments (0)