Sparse convex hull coverage-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Sparse convex hull coverage

Published:2021-10 Issue: Volume:98 Page:101787
ISSN:0925-7721
Container-title:Computational Geometry
language:en
Short-container-title:Computational Geometry

Author:

Klimenko Georgiy,Raichel Benjamin^ORCID,Van Buskirk Gregory

Funder

National Science Foundation Division of Computing and Communication Foundations

National Science Foundation

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications

Reference19 articles.

1. Finding minimal convex nested polygons;Aggarwal;Inf. Comput.,1989

2. k-means++: the advantages of careful seeding;Arthur,2007

3. Approximating Nash equilibria and dense subgraphs via an approximate version of Carathéodory's theorem;Barman;SIAM J. Comput.,2018

4. Sparse approximation via generating point sets;Blum;ACM Trans. Algorithms,2019

5. Optimal CUR matrix decompositions;Boutsidis;SIAM J. Comput.,2017

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

1. Diatom Morphospaces, Tree Spaces and Lineage Crown Groups;Mathematical Macroevolution in Diatom Research;2023-08-28

2. Pretreatment to terahertz absorption curves by narrow undulation constraint and Its quick implementation suggested by convex hull;Scientific Reports;2022-10-24

3. Investigating the geometric structure of neural activation spaces with convex hull approximations;Neurocomputing;2022-08

4. The Deterministic Sensor Deployment Problem for Barrier Coverage in WSNs With Irregular Shape Areas;IEEE Sensors Journal;2022-02-01

5. Automation of Feature Extraction from Panoramic Radiography Mandibular Landmark Point Parameters;SSRN Electronic Journal;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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