dc.contributor.author |
Brimkov, Valentin |
en |
dc.contributor.author |
Dantchev, Stefan |
en |
dc.date.accessioned |
2008-08-21T01:57:13Z |
en |
dc.date.available |
2008-08-21T01:57:13Z |
en |
dc.date.issued |
2004 |
en |
dc.identifier.citation |
Communication and Information Technology Research Technical Report 154, (2004) |
en |
dc.identifier.issn |
1178-3591 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/2811 |
en |
dc.description |
You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site; http://citr.auckland.ac.nz/techreports/ under terms that include this permission. All other rights are reserved by the author(s). |
en |
dc.description.abstract |
We consider the following problem. Given a set of points M = {p1, p2, . . . , pm} ? Rn, decide whether M is a portion of a digital hyperplane and, if so, determine its analytical formulation. In our setting p1, p2, . . . , pm may be arbitrary points (possibly, with rational and/or irrational coefficients) and the dimension n may be any arbitrary fixed integer. We provide an algorithm that solves the problem with O(mlogD) arithmetic operations, where D is a bound on the value of the digital plane coefficients. The solution is based on reducing the digital hyperplane recognition problem to an integer linear programming problem of fixed dimension within an algebraic model of computation. |
en |
dc.publisher |
CITR, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
Communication and Information Technology Research (CITR) Technical Report Series |
en |
dc.rights |
Copyright CITR, The University of Auckland. You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site under terms that include this permission. All other rights are reserved by the author(s). |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://citr.auckland.ac.nz/techreports/2004/CITR-TR-154.pdf |
en |
dc.title |
Digital hyperplane recognition in arbitrary fixed dimension |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |