comp.lang.idl-pvwave archive
Messages from Usenet group comp.lang.idl-pvwave, compiled by Paulo Penteado

Home » Public Forums » archive » Re: Minimum area ellipse - quadratic optimisation?
Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend 
Return to the default flat view Create a new topic Submit Reply
Re: Minimum area ellipse - quadratic optimisation? [message #47631 is a reply to message #47553] Fri, 17 February 2006 09:28 Go to previous message
Olivia is currently offline  Olivia
Messages: 16
Registered: February 2006
Junior Member
>> I posted on this topic before, but it is important that my ellipse
>> fitting method does not rely on convex hulls.

> Is there a special reason for this?

There is a special reason. I am doing a project on galaxy cluster
shapes, comparing the shapes of the clusters as determined by voronoi
tesselations, and by the minimum area ellipses. So fitting ellipses to
convex hulls would give a false comparison.

> Perhaps
> http://geometryalgorithms.com/Archive/algorithm_0107/algorit hm_0107.htm
> could be of some help

This looks like just the thing I am after. I don't think finding the
center point and then finding the minimum area ellipse is a valid
method, after experimenting with it today. I understand the idea of
this fitting algorithm, but after reading the paper by Gaertner and
Schoenherr I doubt if I would be able to right a program to fit the
ellipses myself. Do you know of anyone who might have written one of
these types of programs for IDL? Thanks very much for your idea, and
help.

Olivia
[Message index]
 
Read Message
Read Message
Read Message
Read Message
Read Message
Previous Topic: Another file_search problem
Next Topic: Re: IDLWAVE 6.0 -- idlwave.org

-=] Back to Top [=-
[ Syndicate this forum (XML) ] [ RSS ] [ PDF ]

Current Time: Wed Oct 08 19:33:31 PDT 2025

Total time taken to generate the page: 0.00411 seconds