All Classes and Interfaces
Class
Description
Approximate computation of determinants, involving real numbers
Approximate geometric constructions for plane objects (points, segments, rays)
Approximate geometric constructions for 3D objects (points, segments, rays)
Approximate geometric predicates for plane objects (points, segments, rays)
An implementation of a bit-vector (using memory words on 32 bits)
An implementation of a bit-vector (using memory words on 64 bits)
Minimal implementation of a circular doubly linked list, storing generic type elements
Class allowing to compare two points according to a given coordinate
Incremental 2D Delaunay Triangulation using Face/Vertex data structure (TriangulationDS_2).
Minimal implementation of a doubly connected linked list, storing generic type elements.
Node of a doubly linked list, for storing generic type elements.
Abstract class defining methods for drawing points and segments in a 2D frame
Abstract class defining methods for rendering a surface mesh in 3D
Class for drawing a surface mesh (Polyhedron_3) in 3D, using a Processing PApplet
Abstract class defining methods for drawing a graph in 3D
Exact geometric predicates for plane objects (points, segments, rays)
Computations are performed with infinite precision arithmetic
(using the java.util.BigDecimal class)
A class representing a face of a polyhedral (surface or planar) mesh (Half-edge data structure)
2D window allowing to draw line segments and points
Filtered geometric predicates for plane objects (points, segments, rays)
Remark
Test is filtered: if precision bound epsilon is reached, then perform computation with infinite precision arithmetic (using the java.util.BigDecimal class)
Remark
Test is filtered: if precision bound epsilon is reached, then perform computation with infinite precision arithmetic (using the java.util.BigDecimal class)
Filtered geometric predicates for 3D objects (points, segments, rays)
Interface defining geometric constructions for plane objects (points, segments, rays)
Interface defining geometric constructions for objects in 3D(points, segments, rays)
Deprecated.
refer to class GeometricConstructions_2 and GeometricPredicates_2
Deprecated.
refer to class GeometricConstructions_3 and GeometricPredicates_3
Interface defining geometric predicates for plane objects (points, segments, rays)
Interface defining geometric predicates for 3D objects (points, segments, rays)
A class for representing a 2D point (a cell) on an integer grid.
A class for representing a 2D point on an integer grid.
Class for representing half-edges (half-edge representation of a surface mesh)
A dummy class used to represent a triangulation edge as a pair (TriangulationDSFace_2, int).
Class for representing a pair of integers
Provides predicates and constructions for dealing with segments and circles
This class provides methods for computing mesh statistics (average degree, diameter, ...).
A simple 3d viewer for visualizing surface meshes (based on Processing)
An interface defining geometric primitives and operations on points in euclidean space
A class for representing a 2D point with real coordinates.
Class for representing a point in d-dimensional space R^d
Class representing a collection of points (in arbitrary dimension)
Class representing a collection of points (in 2D)
Class representing a collection of points (in 3D)
Class representing a collection of points (in dimension d)
Pointer-based implementation of the Half-edge data structure for polyhedral meshes
(for representing planar and surface orientable meshes).
Class representing a polyline in arbitrary dimension (ordered sequence of points)
Class representing a polyline in the plane (ordered sequence of points in 2D)
Quad-Edge data structure
Authors: Copyright © 2000–2022, Robert Sedgewick and Kevin Wayne.
A class for representing a 2D points with rational coordinates
A vertex shared representation of a mesh.
Generate a spherical mesh, performing the recursive subdivision of an icosahedron
Generate stacked triangulations, performing the recursive subdivision of triangulation consisting of two triangles
This class provides basic functions for computing some statistical parameters
This class provides methods for testing the Triangle based Data Structure for triangulation
A class for testing the construction of a 2D Delaunay triangulation.
A class for testing the Half-edge data structure representing polyhedral surfaces.
A simple program for testing the random generation of planar triangulations
It generates uniform planar random triangulations,
according to the generator by Poulalhon/Schaeffer (Icalp 2003)
Warning: It works fine for triangulations having up to 2M vertices (with Java 7, 64 bits, 5GB Ram)
Incremental Triangulation using Face/Vertex data structure (TriangulationDS_2).
Data structure for representing 2D triangulations that uses the standard face/vertex encoding,
represented by classes TriangulationDSFace_2 and TriangulationDSVertex_2 respectively.
The class used to encode a face of a triangulation.
The class represents a vertex of a 2D triangulation.
An interface defining primivites and operations on vectors in euclidean space