How to Install and Uninstall gts Package on openSUSE Leap

Last updated: June 30,2024

1. Install "gts" package

Please follow the step by step instructions below to install gts on openSUSE Leap


    
        
            $
        

        
            
                sudo zypper refresh
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo zypper install
            
                        
                gts
            
                    
    
    Copied

2. Uninstall "gts" package

Please follow the steps below to uninstall gts on openSUSE Leap:


    
        
            $
        

        
            
                sudo zypper remove
            
                        
                gts
            
                    
    
    Copied

3. Information about the gts package on openSUSE Leap

Information for package gts:
----------------------------
Repository : Main Repository
Name : gts
Version : 0.7.6_p20121130-1.32
Arch : x86_64
Vendor : SUSE LLC
Installed Size : 213.9 KiB
Installed : No
Status : not installed
Source package : gts-0.7.6_p20121130-1.32.src
Upstream URL : http://gts.sourceforge.net/
Summary : GNU Triangulated Surface Library (GTS)
Description :
GTS stands for the GNU Triangulated Surface Library. It is an Open
Source Free Software Library intended to provide a set of useful
functions to deal with 3D surfaces meshed with interconnected
triangles.
A brief summary of its main features:
* Simple object-oriented structure giving easy access to topological
properties.
* 2D dynamic Delaunay and constrained Delaunay triangulations.
* Robust geometric predicates (orientation, in circle) using fast
adaptive floating point arithmetic (adapted from the fine work of
Jonathan R. Shewchuk).
* Robust set operations on surfaces (union, intersection, difference).
* Surface refinement and coarsening (multiresolution models).
* Dynamic view-independent continuous level-of-detail.
* Preliminary support for view-dependent level-of-detail.
* Bounding-boxes trees and Kd-trees for efficient point location and
collision/intersection detection.
* Graph operations: traversal, graph partitioning.
* Metric operations (area, volume, curvature ...).
* Triangle strips generation for fast rendering.