Particle Swarm Optimization-Based Unconstrained Polygonal Fitting of 2D Shapes
In this paper, we present a general version of polygonal fitting problem called Unconstrained Polygonal Fitting (UPF). Our goal is to represent a given 2D shape <i>S</i> with an N-vertex polygonal curve <i>P</i> with a known number of vertices, so that the Intersection over U...
Main Author: | Costas Panagiotakis |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-01-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | https://www.mdpi.com/1999-4893/17/1/25 |
Similar Items
-
Forms of Crossed and Simple Polygons
by: Luigi Togliani
Published: (2019-12-01) -
Promotion of a No Fit Polygon Algorithm Based on Trajectory
by: ZHOU Xin, LAI Xiaoyang, MENG Xiangqun, WANG Kun, TANG Houjun
Published: (2021-05-01) -
Polygonal Graceful Labeling of Some Simple Graphs
by: A Rama Lakshmi, et al.
Published: (2022-12-01) -
Low complexity demodulator for BFSK waveforms based on polygonal approximation
by: Jorge Torres-Gómez, et al.
Published: (2015-02-01) -
A Study from a Multi-dimensional Curriculum Perspective on Including Concave Polygons in Teaching Polygon Concepts
by: Joowon Do, et al.
Published: (2020-02-01)