PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
February 21, 20260 citationsOpen Access

Minimum Coverage by Convex Polygons: The CG:SHOP Challenge 2023

SFS ́andor P. FeketePKPhillip KeldenichDKDominik Krupke

Key Points

  • The central aim is to address the Minimum Coverage by Convex Polygons problem within the context of computational geometry.
  • Introduced as a challenge in the 2023 Computational Geometry Challenge.
  • Focused on polygonal regions potentially containing holes.
  • Explores strategies for covering these regions with convex subsets.
  • Aims to generate solutions that utilize the least number of convex subsets.
  • Outcome may provide insights into existing methods and new algorithms in computational geometry.

Abstract

We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a problem with a long-standing tradition in Computational Geometry.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Fekete et al. (2026) studied this question.

synapsesocial.com/papers/69994cb3873532290d0216behttps://doi.org/10.57717/cgt.v5i4.115
Ask AI
Helpful
Bookmark
Share
View Full Paper