Search Results for "point"
Sort By:
Showing 35 open source projects for "point"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
Compliant and Reliable File Transfers Backed by Top Security CertificationsStop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
-
1
Swift Algorithms
Commonly used sequence and collection algorithms for Swift
...One inclusion is a pair of chunked methods, each of which break a collection into consecutive subsequences. One version tests adjacent elements to find the breaking point between chunks, you can use it to quickly separate an array into ascending runs. -
2
supercluster
A very fast geospatial point clustering library for browsers and Node
A very fast JavaScript library for geospatial point clustering for browsers and Node. supercluster supports property aggregation with the following two options. Map, a function that returns cluster properties corresponding to a single point. Reduce, a reduce function that merges properties of two clusters into one. -
3
Function Point Analysis
Progressive Function Point Analysis Workbook in Excel
Progressive Function Point Analysis Book Released: Print Copy: http://www.amazon.com/Progressive-Function-Point-Analysis-Estimation/dp/1502354160 EBook: http://www.amazon.com/dp/B00NH0MMAG Please support this project and its future releases ! Managers provide the architect/teams with project requirements. The architect/team returns detailed task list with estimated man hours per task making life easier for Project Managers with less guesstimates and proper business/technical process flows to justify estimates. ... -
4
Quadtree Demo
Demonstrates a quadtree for spatial indexing of triangles
...For this purpose the demo uses a quadtree data structure based on axis-aligned bounding boxes to speed up the search for triangles in a mesh. Depending on a search point all triangles of a quadtree's region are retrieved and relevant information about the search is shown. Quadtree creation can be parametrized by three parameters: - Maximum tree depth. - Maximum number of triangles per region. - Percentage of total number of triangles per region. The OpenGL graphics library is used to render the results, regions as well as the underlying triangle mesh. ... -
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
5
Konbu Check
Linear constraint feasibility check and get program.
This program aims to check and gain a inner point from multiple set of linear constraints. This software works better in the case that range of variables are known and parameters are configured so. C++ and Eigen library needed, and to calculate more accurate, we may need mpfr++ library or, QD library. Freezed. -
6
Skalli
IVS & ILRS Reference Point Determination
Skalli is a simple tool to estimate the IVS (International VLBI Service for Geodesy and Astrometry) and ILRS (International Laser Ranging Service) reference point of a radio or laser telescope. -
7
Point Symmetry Clustering
Point Symmetry Clustering Approach Using Differential Evolution
...You may download code: git clone git://git.code.sf.net/p/pointsymmetryclustering/code pointsymmetryclustering-code 2. Build: mvn clean install assembly:assembly -DskipTests -Dmaven.test.skip=true -DdownloadSources=true -Dcheckstyle.skip=true 3. Run: java -jar target/point-symmetry-clustering-1.0-fat.jar -
8
MyTinySTL
Achieve a tiny STL in C++11
...From version 2.x.x, the project will enter the stage of long-term maintenance, i.e., I probably will not add new content but only fix bugs found. If you find any bugs, please point out them in Issues, or make a Pull request to improve them, thanks! -
9
The Edge Machine Learning library
Machine learning algorithms for edge devices
...The trained models can be loaded onto edge devices such as IoT devices/sensors, and used to make fast and accurate predictions completely offline. A tool that adapts models trained by above algorithms to be inferred by fixed point arithmetic. -
Stop Cyber Threats with VM-Series Next-Gen Firewall on AzureGain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
-
10
Simple Python Fixed-Point Module
Pure-python binary fixed-point arithmetic library
This Python module provides basic facilities for mathematics on fixed-point numbers. The number of fractional binary digits is tunable, allowing near-arbitrary precision arithmetic. Arithmetic & functions such as sqrt, exp, log, sin & cos are available. For the latest releases please visit https://github.com/rwpenney/spfpm -
11
New Terrain and 3D Map System
a very lightweight advanced terrain-rendering and 3D map rendering sys
...It's distrib in 2-3 separate modules: 1. the C++ implementation of the terrain- and/or surface- rendering Algorithms I have developed: both a multithread and a non-multithread variant is relaeased. 2. Seme as at point 1. , but with a road-network rendering and collision-detection module I wrote before. It also adds some trees at the top of the terrain. (multitread vesion not released yet) 3. Seme as point 2.. Multithread terrain-rendering, roads on it, and vehicles to go around. The most important part is terrain-rendering. The Algorithm at the heart of it features my first and second theorem abut polygonal surface approximation. ... -
12
Javascript-Voronoi
JS implementation of Fortune's algorithm to compute Voronoi cells
This repository implements Steven Fortune’s algorithm (sweep-line method) for generating Voronoi diagrams in JavaScript, providing a performant browser-side solution for computational geometry of planar point sets. With this library you can feed a set of sites (points) and compute their Voronoi cells – the partition of the plane into regions closest to each site – in O(n log n) time. It’s especially useful in web UIs, visualizations, interactive maps, and generative-art contexts where you need dynamic tessellations or diagrammatic layouts. ... -
13
Diagonal
A command line toolki to solve a problem your favorite program defines
Diagonal can be used for: - getting descriptive statistics such as mean/median/mode with your program producing a sample - finding a root of an equation your program defines - calculating a fixed point of a function your program defines - detecting a cycle of a fuction your program defines as well as - decoding a VCDIFF file -
14
psimpl - generic n-dimensional polyline simplification. psimpl is a lightweight C++ library that is generic, easy to use, and supports multiple simplification algorithms, including Douglas-Peucker.
-
15
FFT for ARMv6
Fixed point 16/32 integer FFT library for the Raspberry Pi and Android
This library is being created as I have a need to do very fast FFTs on low end devices not supporting the NEON instruction set. The Raspberry Pi is an ideal candidate for developing in gcc before porting to JNI for low spec Android devices, hence it's inclusion. Fixed point 16/32 integer FFT library suitable for the Raspberry Pi and Android devices. Includes test stubs for gcc on the Raspberry Pi and a Basic4Android wrapper from JNI. It includes hand optimised ARMv6 assembler, demonstrating techniques such as pipeline stuffing to achieve maximum performance. It also demonstrates how to include large chunks of assembler inline with C/C++ thus avoiding ABI issues between platforms. -
16
Recursive Interpretation for XML
An interface for recursive descent XML Parsing
...It merges the 1-pass behavior of SAX with the ease of tree manipulation attributed to DOM. In short, RIX works by allowing client code to provide their production rules for any point in the parse tree. There are several advantages of RIX compared to DOM and SAX. DOM gives a full snapshot of the document being parsed, while RIX might be useful for when the document can be interpreted in one pass. Meanwhile, RIX lessens the overhead of writing a SAX-based parser, which might lend itself to a solution based on recursive descent anyway. -
17
A bignum library written in the C++ programming language as templates. It provides standard mathematical operations like add, sub, mul, div, pow etc. with the big integer and big floating point numbers.
-
18
tiny-DSP library
small and fast library dealing with signal processing
Tiny-DSP library contains c sources of a fast, tiny, portable and generic FFT (Fast Fourier transform) and inverse FFT. Supported are all power of two sizes (like 2,4,8,16,32,...) for one and two dimensional floating point arrays. -
19
This is a python implementation that handles floating points correctly,there are still some bugs but I'm working on it . The point was to work around some stuff that made no sense for floats,like 0.1+0.2 == 0.3 is false.
-
20
A random collection of c++ tidbits. I write some code as I go along. Maybe this is useful to anyone. Maybe I will turn some of it into a library at some point. But not now.
-
21
This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.
-
22
FPM - Fixed Point Math substitutes expensive floating point operations by much cheaper integer arithmetics. Use this library in your plain C (gcc) projects if you like.
-
23
a simple software implemented FPU. only 32bit precision is supported and the operation result is not accurate as modern FPUs, but it is light and compact. (uses simple 32bit integer operations only, good for machines that has no hardware FPU.)
-
24
Implementation of Damerau-Levenshtein fuzzy string matching in Java. Returns the distance adding one point per character insert, deletion, mismatche and swap.. This is an extension of apache/commons/lang/StringUtils.getLevenshteinDistance()
-
25
A library that does preform precise floating point operations designed for industrial / banking solutions.
