a point geometry with transforms
[](https://npm.im/@dnd-kit/geometry)
[](https://discord.gg/poimandres)
Shapes and calculators for spherical coordinates.
A mesh replacement for `THREE.Line`. Instead of using GL_LINE, it uses a strip of billboarded triangles. This is a fork of [spite/THREE.MeshLine](https://github.com/spite/THREE.MeshLine), previously maintained by studio [Utsuboco](https://github.com/utsub
The W3C Geometry Interfaces implemented in JavaScript and polyfilled.
No description provided.
ThreeJS geometry for stroking GeoJSON objects on a sphere
ThreeJS geometry for drawing polygons on a sphere
Determines whether the second geometry is completely within the first geometry.
Determines whether the first geometry is completely within the second geometry.
Lightweight utility for input validation and data extraction in Turf.js. Ensures GeoJSON inputs are in the correct format and extracts specific components like coordinates or geometries.
Flow type declarations for [GeoJSON](https://tools.ietf.org/html/rfc7946).
A module to check if a polygon self-intersects using a sweepline algorithm
Removes redundant coordinates from a GeoJSON Geometry.
This library provides classes and functions for the computation of geometric data on the surface of the Earth. Code ported from the Google Maps Javascript API v3
Checks if two geometries cross each other.
A WKT/WKB/EWKT/EWKB/TWKB/GeoJSON parser and serializer
Determine whether each segment of a line is parallel to the correspondent segment of another line.
Simplify geometry using the Ramer–Douglas–Peucker algorithm.
A JavaScript library of spatial predicates and functions for processing geometry
calculate the physical area of a geojson geometry
Checks if two geometries have no overlapping areas.
Determine whether none of the points common to both geometries intersect the interiors of both geometries.
Facade crate for the RustUse geometry workspace.
Utility-first facade crate for RustUse math utilities
Primitive robot pose vocabulary for RustUse robotics
Geographic presence and discovery targeting primitives for RustUse
Unified facade crate for the published RustUse sets and child crates
Small 2D line primitives for RustUse geometry
Small 2D line primitives for RustUse geometry
Small matrix primitives and operations for RustUse
Small vector primitives and operations for RustUse
Small interval and bound primitives for RustUse
Cartesian and spherical geometry using vectors
Adds DMGeometry type to DataMapper that uses GeoRuby for (de)serializing Geometry types into Postgis.
The openstudio-standards library provides methods for programatically generating, modifying, and checking OpenStudio building energy models. It can create a typical building from user geometry, template geometry, or programmatically generated geometry. It can apply a building standard including ASHRAE 90.1 or NECB to a model. It can transform a proposed building model into a 90.1 Appendix G code baseline model. It can check a model against a building standard. It can generate represenative typical buildings, such as those used in ComStock.
This library provides support for loading and processing data from Collada Digital Asset Exchange files. These files are typically used for sharing geometry and scenes.
MAth GEOmetry library to deal with 2 and 3 dimensional spaces. Cartesian and internal coordinate systems can be used. This includes besic objects in 3 dimensional space.
Converts latitude and longitude to Google S2 Cells. Useful for geo stuff. A better description of S2 cells can be found here: http://blog.christianperone.com/2015/08/googles-s2-geometry-on-the-sphere-cells-and-hilbert-curve/
laptimer-geometry is a gem created to help the coordinate calculations used in laptimer software. v0.0.2 - Added a new method to calculate distance between two geographic points - Improved the accuracy of the distance calculation
Glimmer DSL for Swing (JRuby Swing Desktop Development GUI Library) - Enables development of desktop applications using Java Swing, Java AWT, JFC (Java Foundation Classes), and Java 2D, including vector graphics and AWT geometry.
Perfect Shape is a collection of pure Ruby geometric algorithms that are mostly useful for GUI manipulation like checking viewport rectangle intersection or containment of a mouse click point in popular geometry shapes such as rectangle, square, arc (open, chord, and pie), ellipse, circle, polygon, and paths containing lines, quadratic bézier curves, and cubic bezier curves, potentially with affine transforms applied like translation, scale, rotation, shear/skew, and inversion (including both the Ray Casting Algorithm, aka Even-odd Rule, and the Winding Number Algorithm, aka Nonzero Rule). Additionally, it contains some purely mathematical algorithms like IEEEremainder (also known as IEEE-754 remainder).
Painlessly convert arrays to Well-Known Text (WKT) format.
Developed by Sebastian Madrid Ontiveros. Pure Ruby gem providing all Ordnance Survey British National Grid squares (100km, 50km, 10km, 5km, 1km) with hardcoded geometry sourced directly from the OS BNG Grids GeoPackage. Supports point-to-grid-ref lookup by easting/northing, bounds retrieval, grid square validation, listing with filters, and export to ESRI Shapefile format. No external dependencies. Uses only Ruby stdlib. Contains OS data. Crown copyright and database right 2025. Licensed under the Open Government Licence v3.0. Built to support hydraulic modelling and flood risk workflows in the UK. If this gem saves you time, consider buying Sebastian a coffee at https://buymeacoffee.com/smadrid
In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that keeps track of a set of elements partitioned into a number of disjoint (non-overlapping) subsets. It provides near-constant-time operations (bounded by the inverse Ackermann function) to add new sets, to merge existing sets, and to determine whether elements are in the same set. In addition to many other uses (see the Applications section), disjoint-sets play a key role in Kruskal's algorithm for finding the minimum spanning tree of a graph. A disjoint-set forest consists of a number of elements each of which stores an id, a parent pointer, and, in efficient algorithms, a value called the "rank". The parent pointers of elements are arranged to form one or more trees, each representing a set. If an element's parent pointer points to no other element, then the element is the root of a tree and is the representative member of its set. A set may consist of only a single element. However, if the element has a parent, the element is part of whatever set is identified by following the chain of parents upwards until a representative element (one without a parent) is reached at the root of the tree. Forests can be represented compactly in memory as arrays in which parents are indicated by their array index. Disjoint-set data structures model the partitioning of a set, for example to keep track of the connected components of an undirected graph. This model can then be used to determine whether two vertices belong to the same component, or whether adding an edge between them would result in a cycle. The Union–Find algorithm is used in high-performance implementations of unification. This data structure is used by the Boost Graph Library to implement its Incremental Connected Components functionality. It is also a key component in implementing Kruskal's algorithm to find the minimum spanning tree of a graph. Note that the implementation as disjoint-set forests doesn't allow the deletion of edges, even without path compression or the rank heuristic. Sharir and Agarwal report connections between the worst-case behavior of disjoint-sets and the length of Davenport–Schinzel sequences, a combinatorial structure from computational geometry.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.