Algorithmic Perception of Vertices in Sketched Drawings of Polyhedral Shapes

Author:

Company Pedro1,Plumed Raquel2,Varley Peter A. C.2,Camba Jorge D.3

Affiliation:

1. Institute of New Imaging Technology, Universitat Jaume I, Castellon, Spain

2. Departament of Mechanical Engineering and Construction, Universitat Jaume I, Castellon, Spain

3. Department of Computer Graphics Technology, Purdue University, West Lafayette, Indiana, USA

Abstract

In this article, visual perception principles were used to build an artificial perception model aimed at developing an algorithm for detecting junctions in line drawings of polyhedral objects that are vectorized from hand-drawn sketches. The detection is performed in two dimensions (2D), before any 3D model is available and minimal information about the shape depicted by the sketch is used. The goal of this approach is to not only detect junctions in careful sketches created by skilled engineers and designers but also detect junctions when skilled people draw casually to quickly convey rough ideas. Current approaches for extracting junctions from digital images are mostly incomplete, as they simply merge endpoints that are near each other, thus ignoring the fact that different vertices may be represented by different (but close) junctions and that the endpoints of lines that depict edges that share a common vertex may not necessarily be close to each other, particularly in quickly sketched drawings. We describe and validate a new algorithm that uses these perceptual findings to merge tips of line segments into 2D junctions that are assumed to depict 3D vertices.

Publisher

Association for Computing Machinery (ACM)

Subject

Experimental and Cognitive Psychology,General Computer Science,Theoretical Computer Science

Reference19 articles.

1. An optimisation-based reconstruction engine for 3D modelling by sketching

2. P. Company P. A. C. Varley R. Plumed and J. D. Camba. 2017. Source Code for Finding Vertices in 2D Line-drawings of Polyhedral Shapes. Technical Report. Regeo (2018) Geometric Reconstruction Group. Retrieved from http://www.regeo.uji.es/FindingVertices.htm. P. Company P. A. C. Varley R. Plumed and J. D. Camba. 2017. Source Code for Finding Vertices in 2D Line-drawings of Polyhedral Shapes. Technical Report. Regeo (2018) Geometric Reconstruction Group. Retrieved from http://www.regeo.uji.es/FindingVertices.htm.

3. P. Company P. A. C. Varley R. Plumed and J. D. Camba. 2019. Detection of vertices in sketched drawings of polyhedral shapes. In LNCS 11401 (CIARP 2018). 376--383. P. Company P. A. C. Varley R. Plumed and J. D. Camba. 2019. Detection of vertices in sketched drawings of polyhedral shapes. In LNCS 11401 (CIARP 2018). 376--383.

4. Uncertainty in Communication with a Sketch

5. Fidelity vs. simplicity

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3