使用 Sobel 运算符选择顶点的图像三角剖分法

Olivia Laske, Lori Ziegelmeier
{"title":"使用 Sobel 运算符选择顶点的图像三角剖分法","authors":"Olivia Laske, Lori Ziegelmeier","doi":"arxiv-2408.16112","DOIUrl":null,"url":null,"abstract":"Image triangulation, the practice of decomposing images into triangles,\ndeliberately employs simplification to create an abstracted representation.\nWhile triangulating an image is a relatively simple process, difficulties arise\nwhen determining which vertices produce recognizable and visually pleasing\noutput images. With the goal of producing art, we discuss an image\ntriangulation algorithm in Python that utilizes Sobel edge detection and point\ncloud sparsification to determine final vertices for a triangulation, resulting\nin the creation of artistic triangulated compositions.","PeriodicalId":501570,"journal":{"name":"arXiv - CS - Computational Geometry","volume":"20 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Image Triangulation Using the Sobel Operator for Vertex Selection\",\"authors\":\"Olivia Laske, Lori Ziegelmeier\",\"doi\":\"arxiv-2408.16112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Image triangulation, the practice of decomposing images into triangles,\\ndeliberately employs simplification to create an abstracted representation.\\nWhile triangulating an image is a relatively simple process, difficulties arise\\nwhen determining which vertices produce recognizable and visually pleasing\\noutput images. With the goal of producing art, we discuss an image\\ntriangulation algorithm in Python that utilizes Sobel edge detection and point\\ncloud sparsification to determine final vertices for a triangulation, resulting\\nin the creation of artistic triangulated compositions.\",\"PeriodicalId\":501570,\"journal\":{\"name\":\"arXiv - CS - Computational Geometry\",\"volume\":\"20 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Computational Geometry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.16112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.16112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

图像三角剖分是将图像分解成三角形的一种做法,它有意采用简化的方法来创建抽象的表示形式。虽然图像三角剖分是一个相对简单的过程,但在确定哪些顶点能生成可识别且视觉上悦目的输出图像时却会遇到困难。为了制作艺术作品,我们讨论了 Python 中的一种图像三角剖分算法,该算法利用索贝尔边缘检测和点云稀疏化来确定三角剖分的最终顶点,从而创作出具有艺术性的三角剖分作品。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Image Triangulation Using the Sobel Operator for Vertex Selection
Image triangulation, the practice of decomposing images into triangles, deliberately employs simplification to create an abstracted representation. While triangulating an image is a relatively simple process, difficulties arise when determining which vertices produce recognizable and visually pleasing output images. With the goal of producing art, we discuss an image triangulation algorithm in Python that utilizes Sobel edge detection and point cloud sparsification to determine final vertices for a triangulation, resulting in the creation of artistic triangulated compositions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Minimum Plane Bichromatic Spanning Trees Evolving Distributions Under Local Motion New Lower Bound and Algorithms for Online Geometric Hitting Set Problem Computing shortest paths amid non-overlapping weighted disks Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1