Re: WANTED: Algorithm to fit data points to ellipse

Article View: sci.math.num-analysis

Article #183

Back to sci.math.num-analysis Previous Next

#183

From: pfennige
Date: Tue, 04 Aug 1992 08:36

15 lines
1285 bytes

In article <1992Jul30.235659.23179@terminator.cc.umich.edu>, reimann@terminator.cc.umich.edu (Dave Reimann) writes:
> I need an algorithm to fit a general ellipse to a set of data points.
> By generalized ellipse, I mean one that accounts for any tilt in the
> major axis wrt the x-axis.  The data is expected to have some estimation 
> error, so I need to handle that.

You can get robust Fortran algorithms least-squares fitting circles or ellipses
(fcircle.f, fellipse.f and ls.f) to 2D data points by anonymous ftp at 
	obs.unige.ch (129.194.64.1) 
in the directory /fit.  The result is invariant by rotation and translation of 
the data points.  fcircle.f and fellipse.f contain both an example program 
and the actual fitting subroutines.  ls.f are linear least-squares subroutines
by Lawson & Hanson. 

	Daniel Pfenniger

Technical Details

Message-ID: <1992Aug4.103637.1503@uni2a.unige.ch>

Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!ira.uka.de!chx400!ugun2b!ugun2a!pfennige

References: <1992Jul30.235659.23179@terminator.cc.umich.edu>

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!sol.ctr.columbia.edu!ira.uka.de!chx400!ugun2b!ugun2a!pfennige
Newsgroups: sci.math.num-analysis
Subject: Re: WANTED: Algorithm to fit data points to ellipse
Message-ID: <1992Aug4.103637.1503@uni2a.unige.ch>
From: pfennige@uni2a.unige.ch
Date: 4 Aug 92 10:36:37 +0200
References: <1992Jul30.235659.23179@terminator.cc.umich.edu>
Organization: University of Geneva, Switzerland
Lines: 16

Reply to Parent Message