This is a staging site. Uploads will not persist. Testing only.
libmrpt-rtti2.5
Mobile Robot Programming Toolkit - rtti library
The Mobile Robot Programming Toolkit (MRPT) is an extensive, cross-platform,
and open source C++ library aimed to help robotics researchers to design and
implement algorithms in the fields of Simultaneous Localization and Mapping
(SLAM), computer vision, and motion planning (obstacle avoidance).
fp-units-win-misc-3.2.2
Free Pascal - miscellaneous units
The Free Pascal Compiler is an Object Pascal compiler supporting both Delphi
and Turbo Pascal 7.0 dialects, as well as Mac Pascal dialects. It provides a
completely portable RunTime Library (RTL) available on many platforms and
compatible with Turbo Pascal, along with a platform-independent class-based
Free Component Library (FCL) adding many Delphi extensions and interfacing
with many popular open source libraries.
libmapnik4.0.0
C++ toolkit for developing GIS applications (libraries)
Mapnik is an OpenSource C++ toolkit for developing GIS
(Geographic Information Systems) applications. At the core is a C++
shared library providing algorithms/patterns for spatial data access and
visualization.
python3-btsocket
Python interface for BlueZ Bluetooth Management API
This package provides a Python interface to the BlueZ Bluetooth Management
API, which is the official Linux Bluetooth protocol stack. This library is
particularly useful for developers needing to interact with Bluetooth
hardware at a low level using Python. It offers functionalities to control
and monitor Bluetooth devices directly from a Linux system.
libmrpt-vision2.5
Mobile Robot Programming Toolkit - vision library
The Mobile Robot Programming Toolkit (MRPT) is an extensive, cross-platform,
and open source C++ library aimed to help robotics researchers to design and
implement algorithms in the fields of Simultaneous Localization and Mapping
(SLAM), computer vision, and motion planning (obstacle avoidance).
liblrs2
package to enumerate vertices and extreme rays (shared libraries)
A convex polyhedron is the set of points satisfying a finite family
of linear inequalities. The study of the vertices and extreme rays
of such systems is important and useful in e.g. mathematics and
optimization. In a dual interpretation, finding the vertices of a
(bounded) polyhedron is equivalent to finding the convex hull
(bounding inequalities) of an (arbitrary dimensional) set of points.
Lrs (lexicographic reverse search) has two important features that
can be very important for certain applications: it works in exact
arithmetic, and it consumes memory proportional to the input, no
matter how large the output is.