How to Install and Uninstall earcut-hpp-devel.noarch Package on Red Hat Enterprise Linux 8 (RHEL 8)
Last updated: November 27,2024
1. Install "earcut-hpp-devel.noarch" package
This is a short guide on how to install earcut-hpp-devel.noarch on Red Hat Enterprise Linux 8 (RHEL 8)
$
sudo dnf update
Copied
$
sudo dnf install
earcut-hpp-devel.noarch
Copied
2. Uninstall "earcut-hpp-devel.noarch" package
Please follow the step by step instructions below to uninstall earcut-hpp-devel.noarch on Red Hat Enterprise Linux 8 (RHEL 8):
$
sudo dnf remove
earcut-hpp-devel.noarch
Copied
$
sudo dnf autoremove
Copied
3. Information about the earcut-hpp-devel.noarch package on Red Hat Enterprise Linux 8 (RHEL 8)
Last metadata expiration check: 1:00:29 ago on Mon Feb 26 15:59:38 2024.
Available Packages
Name : earcut-hpp-devel
Version : 2.2.4
Release : 4.el8
Architecture : noarch
Size : 19 k
Source : earcut-hpp-2.2.4-4.el8.src.rpm
Repository : epel
Summary : Fast, header-only polygon triangulation
URL : https://github.com/mapbox/earcut.hpp
License : ISC
Description : A C++ port of earcut.js, a fast, header-only polygon triangulation library.
:
: The library implements a modified ear slicing algorithm, optimized by z-order
: curve hashing and extended to handle holes, twisted polygons, degeneracies and
: self-intersections in a way that doesn’t guarantee correctness of
: triangulation, but attempts to always produce acceptable results for practical
: data like geographical shapes.
:
: It’s based on ideas from FIST: Fast Industrial-Strength Triangulation of
: Polygons by Martin Held and Triangulation by Ear Clipping by David Eberly.
Available Packages
Name : earcut-hpp-devel
Version : 2.2.4
Release : 4.el8
Architecture : noarch
Size : 19 k
Source : earcut-hpp-2.2.4-4.el8.src.rpm
Repository : epel
Summary : Fast, header-only polygon triangulation
URL : https://github.com/mapbox/earcut.hpp
License : ISC
Description : A C++ port of earcut.js, a fast, header-only polygon triangulation library.
:
: The library implements a modified ear slicing algorithm, optimized by z-order
: curve hashing and extended to handle holes, twisted polygons, degeneracies and
: self-intersections in a way that doesn’t guarantee correctness of
: triangulation, but attempts to always produce acceptable results for practical
: data like geographical shapes.
:
: It’s based on ideas from FIST: Fast Industrial-Strength Triangulation of
: Polygons by Martin Held and Triangulation by Ear Clipping by David Eberly.