From owner-svn-ports-all@FreeBSD.ORG Fri Aug 31 13:45:41 2012 Return-Path: Delivered-To: svn-ports-all@freebsd.org Received: from mx1.freebsd.org (mx1.freebsd.org [69.147.83.52]) by hub.freebsd.org (Postfix) with ESMTP id 59400106564A; Fri, 31 Aug 2012 13:45:41 +0000 (UTC) (envelope-from cs@FreeBSD.org) Received: from svn.freebsd.org (svn.freebsd.org [IPv6:2001:4f8:fff6::2c]) by mx1.freebsd.org (Postfix) with ESMTP id 3A3508FC08; Fri, 31 Aug 2012 13:45:41 +0000 (UTC) Received: from svn.freebsd.org (localhost [127.0.0.1]) by svn.freebsd.org (8.14.4/8.14.4) with ESMTP id q7VDjfP0039768; Fri, 31 Aug 2012 13:45:41 GMT (envelope-from cs@svn.freebsd.org) Received: (from cs@localhost) by svn.freebsd.org (8.14.4/8.14.4/Submit) id q7VDjeTS039764; Fri, 31 Aug 2012 13:45:41 GMT (envelope-from cs@svn.freebsd.org) Message-Id: <201208311345.q7VDjeTS039764@svn.freebsd.org> From: Carlo Strub Date: Fri, 31 Aug 2012 13:45:40 +0000 (UTC) To: ports-committers@freebsd.org, svn-ports-all@freebsd.org, svn-ports-head@freebsd.org X-SVN-Group: ports-head MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Cc: Subject: svn commit: r303422 - head/astro/match X-BeenThere: svn-ports-all@freebsd.org X-Mailman-Version: 2.1.5 Precedence: list List-Id: SVN commit messages for the ports tree List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Fri, 31 Aug 2012 13:45:41 -0000 Author: cs Date: Fri Aug 31 13:45:40 2012 New Revision: 303422 URL: http://svn.freebsd.org/changeset/ports/303422 Log: - Update to 0.15 (this involved a big change in the algorithms used) - Tidy COMMENT - Update pkg-descr to the new description Modified: head/astro/match/Makefile head/astro/match/distinfo head/astro/match/pkg-descr Modified: head/astro/match/Makefile ============================================================================== --- head/astro/match/Makefile Fri Aug 31 13:43:31 2012 (r303421) +++ head/astro/match/Makefile Fri Aug 31 13:45:40 2012 (r303422) @@ -7,13 +7,13 @@ # PORTNAME= match -PORTVERSION= 0.14 +PORTVERSION= 0.15 CATEGORIES= astro MASTER_SITES= http://spiff.rit.edu/match/ \ http://www.c-s.li/ports/ MAINTAINER= cs@FreeBSD.org -COMMENT= A program for matching star lists +COMMENT= Program for matching star lists LICENSE= GPLv2 Modified: head/astro/match/distinfo ============================================================================== --- head/astro/match/distinfo Fri Aug 31 13:43:31 2012 (r303421) +++ head/astro/match/distinfo Fri Aug 31 13:45:40 2012 (r303422) @@ -1,2 +1,2 @@ -SHA256 (match-0.14.tar.gz) = f4afc1275ca1ce4447810c6d85f9b708f479fb27f3ce31503dcfcdaef2f252ec -SIZE (match-0.14.tar.gz) = 180101 +SHA256 (match-0.15.tar.gz) = 73e7ba7ce43fae657e2845515c2bb77e52fe8ae10bf24fc51a0a94340203a102 +SIZE (match-0.15.tar.gz) = 194219 Modified: head/astro/match/pkg-descr ============================================================================== --- head/astro/match/pkg-descr Fri Aug 31 13:43:31 2012 (r303421) +++ head/astro/match/pkg-descr Fri Aug 31 13:45:40 2012 (r303422) @@ -1,14 +1,18 @@ This program is designed to match up items in two different lists, which may have two different systems of coordinates. The program allows the two sets of -coordinates to be related by a linear, quadratic, or cubic transformation. It -is an implementation of the algorithm described in Valdes et al., Publications -of the Astronomical Society of the Pacific, vol 107, page 1119 (1995). +coordinates to be related by a linear, quadratic, or cubic transformation. +There was a major change in version 0.15: the first stage uses the clever method +of finding the most likely triangles described in Tabur, Publications of the +Astronomical Society of Australia, vol 24 , page 189 (2007). This replaces the +more brute-force-ish method of Valdes et al., Publications of the Astronomical +Society of the Pacific, vol 107, page 1119 (1995), which was employed in version +up to 0.14. The program was designed and written to work on lists of stars and other astronomical objects, but it might be applied to other types of data. In order to match two lists of N points, the main algorithm calls for O(N^6) operations (yes, that's N-to-the-sixth), so it's not the most efficient choice. I find -myself becoming impatient for N >= 100, but your mileage may vary. On the -other hand, it does allow for arbitrary translation, rotation, and scaling... +myself becoming impatient for N >= 100, but your mileage may vary. On the other +hand, it does allow for arbitrary translation, rotation, and scaling... WWW: http://spiff.rit.edu/match/