Triangulating a simple polygon
From MaRDI portal
Cites work
Cited in
(60)- Visible surface calculation for complex unstructured polygonal scenes
- Generalized Delaunay triangulation for planar graphs
- The power of geometric duality
- Visibility of disjoint polygons
- Visibility between two edges of a simple polygon
- Nonobtuse triangulation of polygons
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Hidden-surface removal in polyhedral cross-sections
- Computing the link center of a simple polygon
- An optimal visibility graph algorithm for triangulated simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- On geodesic properties of polygons relevant to linear time triangulation
- Triangulating a simple polygon in linear time
- Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
- Computing bushy and thin triangulations
- Parallel methods for visibility and shortest-path problems in simple polygons
- The furthest-site geodesic Voronoi diagram
- Approximation algorithms for partitioning a rectangle with interior points
- A workbench for computational geometry
- Geometric classification of triangulations and their enumeration in a convex polygon
- A simple linear algorithm for intersecting convex polygons
- A unifying approach for a class of problems in the computational geometry of polygons
- Computing geodesic furthest neighbors in simple polygons
- A fast Las Vegas algorithm for triangulating a simple polygon
- Applications of a two-dimensional hidden-line algorithm to other geometric problems
- Finding a closet visible vertex pair between two polygons
- Affine invariant triangulations
- Triangulation algorithms for generating as-is floor plans
- Computing the intersection-depth to polyhedra
- On compatible triangulations of simple polygons
- Memory-constrained algorithms for simple polygons
- Computing conforming partitions of orthogonal polygons with minimum stabbing number
- Approximation algorithms for decomposing octilinear polygons
- Computational and structural advantages of circular boundary representation
- A new triangulation-linear class of simple polygons
- Two algorithms for constructing a Delaunay triangulation
- Reprint of: Memory-constrained algorithms for simple polygons
- Dynamic Trees and Dynamic Point Location
- EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS
- THREE-DIMENSIONAL TOPOLOGICAL SWEEP FOR COMPUTING ROTATIONAL SWEPT VOLUMES OF POLYHEDRAL OBJECTS
- Method for finding and storing optimal triangulations based on square matrix
- Space-time trade-offs for stack-based algorithms
- A linear-time construction of the relative neighborhood graph within a histogram
- REGION INTERVISIBILITY IN TERRAINS
- Computing the geodesic center of a simple polygon
- On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples
- Shortcut hulls: vertex-restricted outer simplifications of polygons
- Rectangularization of digital objects and its relation with straight skeletons
- Geometric pattern matching under Euclidean motion
- Linear-time algorithms for weakly-monotone polygons
- Minimum star partitions of simple polygons in polynomial time
- Monotone partitions of simple polygons
- Pizza sharing is PPA-hard
- On the minimality of polygon triangulation
- A decision procedure for optimal polyhedron partitioning
- On partitioning rectilinear polygons into star-shaped polygons
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Some chain visibility problems in a simple polygon
- Minimum k-partitioning of rectilinear polygons
- Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
This page was built for publication: Triangulating a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1249042)
