Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
15
click to vote
COMGEO
2008
ACM
favorite
Email
discuss
report
69
views
Applied Computing
»
more
COMGEO 2008
»
Triangulations without pointed spanning trees
13 years 7 months ago
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
more »
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)
Researcher Info
Applied Computing Study Group
Computer Vision