Sciweavers

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

13

CCCG
2004

favoriteEmaildiscussreport

146views Computational Geometry» more CCCG 2004»

On computing enclosing isosceles triangles and related problems

13 years 6 months ago

On computing enclosing isosceles triangles and related problems

Download www.ams.sunysb.edu

Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then study a 3-dimensional version of the problem where we enclose a point set with a cone of fixed aperture .

Prosenjit Bose, Carlos Seara, Saurabh Sethia

Real-time Traffic

3-dimensional Version | CCCG 2004 | CCCG 2007 | Triangles | Various Enclosing Isosceles |

claim paper

Related Content

» Two Algorithms for the Minimum Enclosing Ball Problem

» Smaller coresets for balls

» Locked and unlocked chains of planar shapes

» Recognizing Seki in Computer Go

» NonRigid Structure from LocallyRigid Motion

» Coresets sparse greedy approximation and the FrankWolfe algorithm

» Network Coordinates in the Wild

» Conformal Mapping by Computationally Efficient Methods

» People Counting in Low Density Video Sequences

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2004
Where	CCCG
Authors	Prosenjit Bose, Carlos Seara, Saurabh Sethia

Comments (0)