An arithmetical characterization of the convex hull of digital straight segments

被引:1
|
作者
机构
[1] Roussillon, Tristan
来源
| 1600年 / Springer Verlag卷 / 8668期
关键词
All Open Access; Bronze;
D O I
10.1007/978-3-319-09955-2_13
中图分类号
学科分类号
摘要
18
引用
收藏
相关论文
共 50 条
  • [21] An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments
    Li, Nan
    Jiang, Bo
    Li, Nannan
    PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND APPLICATION ENGINEERING (CSAE2018), 2018,
  • [22] Digital straight line segments in finite topological spaces
    Eguchi, M
    Imura, H
    Fuwa, Y
    Nakamura, Y
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1998, 81 (02): : 34 - 45
  • [23] A characterization theorem and an algorithm for a convex hull problem
    Kalantari, Bahman
    ANNALS OF OPERATIONS RESEARCH, 2015, 226 (01) : 301 - 349
  • [24] A characterization theorem and an algorithm for a convex hull problem
    Bahman Kalantari
    Annals of Operations Research, 2015, 226 : 301 - 349
  • [25] On the convex hull and homothetic convex hull functions of a convex body
    Ákos G. Horváth
    Zsolt Lángi
    Geometriae Dedicata, 2022, 216
  • [26] On the convex hull and homothetic convex hull functions of a convex body
    Horvath, Akos G.
    Langi, Zsolt
    GEOMETRIAE DEDICATA, 2022, 216 (01)
  • [27] ALGORITHMS FOR SUBPATH CONVEX HULL QUERIES AND RAY-SHOOTING AMONG SEGMENTS
    Wang, Haitao
    SIAM JOURNAL ON COMPUTING, 2024, 53 (04) : 1132 - 1161
  • [28] Maximal digital straight segments and convergence of discrete geometric estimators
    de Vieilleville, F
    Lachaud, JO
    Feschet, F
    IMAGE ANALYSIS, PROCEEDINGS, 2005, 3540 : 988 - 997
  • [29] HULL, STRAIGHT BIOLOGY, AND STRAIGHT EPISTEMOLOGY
    MUNEVAR, G
    BIOLOGY & PHILOSOPHY, 1988, 3 (02) : 209 - 214
  • [30] A method using long digital straight segments for fingerprint recognition
    Jiang, Xiubao
    You, Xinge
    Yuan, Yuan
    Cong, Mingming
    NEUROCOMPUTING, 2012, 77 (01) : 28 - 35