.png){kind=icon}
返回
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model
.png){kind=icon}
PRE
AI
DOI：10.1016/j.imavis.2006.06.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present an algorithm for the integer linear programming (ILP) problem within an algebraic model of computation 1 2 and use it to solve the following digital plane segment recognition problem: Given a set of points M = {p(1),p(2), . . . , p(m)} subset of R-n, decide whether M is a portion of a digital hyperplane and, if so, determine its analytical representation. In our setting p(1), P-2,...,p(m) may be arbitrary points (possibly, with rational and/or irrational coefficients) and the dimension n may be any arbitrary fixed integer. We reduce this last problem to an ILP to which our general integer programming algorithm applies. It performs 0(m log D) arithmetic operations, where D is a bound on the norm of the domain elements. For the special case of problem dimension two, we propose an elementary algorithm that takes advantage of the specific geometry of the problem and appears to be optimal. It implies an efficient algorithm for digital line segment recognition. (c) 2006 Elsevier B.V. All rights reserved.
Keyword:
digital hyperplane
digital plane recognition
integer programming
Euclidean algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
4.1K
被引数:
6.7K
机构
暂无机构信息
引用论文
The Environment and Postmodern Spatial Consciousness: A Sociology of Urban Environmental Agendas
PREAI
分享收藏Isolation and characterization of the large cyanogen bromide peptides from the α1‐ and α2‐chains of pig skin collagen.png)
FEBS Letters
FEBS LettersIF0
PREAI
分享收藏
Estimation of nitrogen fixation by four legumes in a dry monsoonal area of north-western Australia
PREAI
分享收藏
查看更多内容