On the public citation graph
Triangulating a simple polygon in linear time
0 signed · 593 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-12689-9_105openalex-snapshot
Fast triangulation of simple polygons
inferredcites →https://doi.org/10.1007/978-4-431-68123-6_26openalex-snapshot
An Output-Complexity-Sensitive Polygon Triangulation Algorithm
inferredcites →https://doi.org/10.1007/bf01553883openalex-snapshot
An optimal visibility graph algorithm for triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf01762127openalex-snapshot
Decomposition and intersection of simple splinegons
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf02187741openalex-snapshot
A fast las vegas algorithm for triangulating a simple polygon
inferredcites →https://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0022-0000(89)90041-xopenalex-snapshot
Optimal shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1016/0022-0000(90)90016-eopenalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferredcites →https://doi.org/10.1016/0031-3203(82)90057-7openalex-snapshot
On a convex hull algorithm for polygons and its application to triangulation problems
inferredcites →https://doi.org/10.1016/0262-8856(89)90037-1openalex-snapshot
Computational morphology
inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot
Finding the intersection of two convex polyhedra
inferredcites →https://doi.org/10.1016/0734-189x(86)90127-1openalex-snapshot
A linear time algorithm for minimum link paths inside a simple polygon
inferredcites →https://doi.org/10.1016/0925-7721(91)90012-4openalex-snapshot
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
inferredcites →https://doi.org/10.1016/j.comgeo.2010.03.003openalex-snapshot
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
inferredcites →https://doi.org/10.1016/s0019-9958(86)80033-xopenalex-snapshot
Sorting jordan sequences in linear time using level-linked search trees
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
inferredcites →https://doi.org/10.1145/1499949.1500071openalex-snapshot
A polyhedron representation for computer vision
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/357337.357340openalex-snapshot
Triangulation and shape-complexity
inferredcites →https://doi.org/10.1145/357337.357341openalex-snapshot
Triangulating Simple Polygons and Equivalent Problems
inferredcites →https://doi.org/10.1145/41958.41960openalex-snapshot
Finding the visibility graph of a simple polygon in time proportional to its size
inferredcites →https://doi.org/10.1145/73393.73406openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.1145/73393.73407openalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferredcites →https://doi.org/10.1145/98524.98533openalex-snapshot
Polygon triangulation in O ( n log log n ) time with simple data-structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.19980440104openalex-snapshot
Quadrilaterizing an Orthogonal Polygon in Parallel
inferred← citeshttps://doi.org/10.1002/net.3230260412openalex-snapshot
Encoding shortest paths in spatial networks
inferred← citeshttps://doi.org/10.1002/nme.5752openalex-snapshot
Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
inferred← citeshttps://doi.org/10.1002/nme.808openalex-snapshot
‘Ultimate’ robustness in meshing an arbitrary polyhedron
inferred← citeshttps://doi.org/10.1002/qua.26006openalex-snapshot
Computing weighted Szeged and PI indices from quotient graphs
inferred← citeshttps://doi.org/10.1002/qua.26530openalex-snapshot
General cut method for computing Szeged‐like topological indices with applications to molecular graphs
inferred← citeshttps://doi.org/10.1006/jagm.1995.0808openalex-snapshot
Constructing Piecewise Linear Homeomorphisms of Simple Polygons
inferred← citeshttps://doi.org/10.1006/jagm.1995.1017openalex-snapshot
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
inferred← citeshttps://doi.org/10.1007/11589440_18openalex-snapshot
An Optimal Algorithm for the 1-Searchability of Polygonal Rooms
inferred← citeshttps://doi.org/10.1007/11949534_28openalex-snapshot
Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-30790-7_2openalex-snapshot
On the Convexification of Unstructured Grids from a Scientific Visualization Perspective
inferred← citeshttps://doi.org/10.1007/3-540-37623-2_6openalex-snapshot
Upward Planarity Checking: “Faces Are More than Polygons”
inferred← citeshttps://doi.org/10.1007/3-540-40996-3_48openalex-snapshot
Optimal Polygon Cover Problems and Applications
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_26openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-44842-x_92openalex-snapshot
Partitioning Polygons into Tree Monotone and Y -monotone Subpolygons
inferred← citeshttps://doi.org/10.1007/3-540-45471-3_9openalex-snapshot
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains
inferred← citeshttps://doi.org/10.1007/3-540-47789-6_8openalex-snapshot
A Linear Time Heuristics for Trapezoidation of GIS Polygons
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_172openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_174openalex-snapshot
Computational geometry for the gourmet old fare and new dishes
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_60openalex-snapshot
An incremental algorithm for constructing shortest watchman routes
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_235openalex-snapshot
An optimal algorithm for finding the separation of simple polygons
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_49openalex-snapshot
Trekking in the Alps without freezing or getting tired
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_236openalex-snapshot
Constructing shortest watchman routes by divide-and-conquer
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_11openalex-snapshot
Finding all weakly-visible chords of a polygon in linear time
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_64openalex-snapshot
Quadrangulations of planar sets
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_50openalex-snapshot
On condorcet and median points of simple rectilinear polygons
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_150openalex-snapshot
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_151openalex-snapshot
External-memory algorithms for processing line segments in geographic information systems
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_59openalex-snapshot
Checking the convexity of polytopes and the planarity of subdivisions (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63307-3_79openalex-snapshot
Constructing pairwise disjoint paths with few links
inferred← citeshttps://doi.org/10.1007/3-540-63507-6_201openalex-snapshot
Analysis situs and image processing
inferred← citeshttps://doi.org/10.1007/3-540-64823-2_4openalex-snapshot
dedale, a spatial constraint database
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_16openalex-snapshot
Guarding Galleries and Terrains
inferred← citeshttps://doi.org/10.1007/978-1-4471-2256-2_5openalex-snapshot
Partitioning a Polygon or the Plane
inferred← citeshttps://doi.org/10.1007/978-1-4471-4075-7_14openalex-snapshot
Triangle Mesh Generation: Delaunay Triangulation
inferred← citeshttps://doi.org/10.1007/978-1-4612-2628-4_27openalex-snapshot
Decomposition Algorithms in Geometry
inferred← citeshttps://doi.org/10.1007/978-1-4615-5319-9_3openalex-snapshot
Minimum Convex Partitions of Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_4openalex-snapshot
Maintaining the Visibility Graph of a Dynamic Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_36openalex-snapshot
Most Vital Segment Barriers
inferred← citeshttps://doi.org/10.1007/978-3-030-25005-8_2openalex-snapshot
Computing the k-Crossing Visibility Region of a Point in a Polygon
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_21openalex-snapshot
An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model
inferred← citeshttps://doi.org/10.1007/978-3-030-54921-3_6openalex-snapshot
Guarding a Polygon Without Losing Touch
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_25openalex-snapshot
Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_12openalex-snapshot
Planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths
inferred← citeshttps://doi.org/10.1007/978-3-031-34347-6_2openalex-snapshot
Point Enclosure Problem for Homothetic Polygons
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_13openalex-snapshot
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-031-49193-1_6openalex-snapshot
A Sub-quadratic Time Algorithm for Computing the Beacon Kernel of Simple Polygons
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_6openalex-snapshot
Monotone Partitions of Simple Polygons
inferred← citeshttps://doi.org/10.1007/978-3-032-07623-6_5openalex-snapshot
Local Symmetry Polylines Construction and Their Use
inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_5openalex-snapshot
Morphing Planar Graph Drawings Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-319-12099-7_3openalex-snapshot
Euclidean Space and Continuous Space
inferred← citeshttps://doi.org/10.1007/978-3-319-12099-7_9openalex-snapshot
Combinatorial Topology and Digital Topology
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_12openalex-snapshot
An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-319-17885-1_1601openalex-snapshot
Topological Information and Spatial Constraint Data
inferred← citeshttps://doi.org/10.1007/978-3-319-23519-6_1601-1openalex-snapshot
Topological Information and Spatial Constraint Data
inferred← citeshttps://doi.org/10.1007/978-3-319-32467-8_104openalex-snapshot
Constrained Triangulation of 2D Shapes
inferred← citeshttps://doi.org/10.1007/978-3-319-56357-2_7openalex-snapshot
Optimizing the Algorithm Localization Mobile Robot Using Triangulation Map
inferred← citeshttps://doi.org/10.1007/978-3-319-77028-4_87openalex-snapshot
Degree Aware Triangulation of Annular Regions
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_26openalex-snapshot
Planar Embeddings of Graphs with Specified Edge Lengths
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_55openalex-snapshot
Selected Open Problems in Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_18openalex-snapshot
A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_41openalex-snapshot
Approximate Unions of Lines and Minkowski Sums
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_25openalex-snapshot
Minimum weight pseudo-triangulations (Extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-68405-3_5openalex-snapshot
Caging Polygons with Two and Three Fingers
inferred← citeshttps://doi.org/10.1007/978-3-540-70904-6_7openalex-snapshot
Angle and Distance Constraints on Tree Drawings
inferred← citeshttps://doi.org/10.1007/978-3-540-74272-2_82openalex-snapshot
Euclidean Shortest Paths in Simple Cube Curves at a Glance
inferred← citeshttps://doi.org/10.1007/978-3-540-74272-2_90openalex-snapshot
Decomposing a Simple Polygon into Trapezoids
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_59openalex-snapshot
Optimal Triangulation with Steiner Points
inferred← citeshttps://doi.org/10.1007/978-3-540-87730-1_8openalex-snapshot
Smooth Linear Approximation of Non-overlap Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_15openalex-snapshot
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-540-92295-7_14openalex-snapshot
A Cost-Optimal Algorithm for Guard Zone Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_14openalex-snapshot
Generating All Triangulations of Plane Graphs (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_5openalex-snapshot
Algorithms for Computing Diffuse Reflection Paths in Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_12openalex-snapshot
Delaunay Triangulation of Imprecise Points Simplified and Extended
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_1openalex-snapshot
Graph-Theoretic Solutions to Computational Geometry Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_2openalex-snapshot
Constant-Work-Space Algorithm for a Shortest Path in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-12200-2_40openalex-snapshot
Matching Points with Things
inferred← citeshttps://doi.org/10.1007/978-3-642-12651-2_4openalex-snapshot
Content-Based 3D Model Retrieval
inferred← citeshttps://doi.org/10.1007/978-3-642-13731-0_20openalex-snapshot
Representing a Functional Curve by Curves with Fewer Peaks
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_3openalex-snapshot
Evacuation of Rectilinear Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_20openalex-snapshot
Beyond Triangulation: Covering Polygons with Triangles
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_41openalex-snapshot
A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_25openalex-snapshot
Cutting Out Polygons with a Circular Saw
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_4openalex-snapshot
Proportional Contact Representations of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_506-1openalex-snapshot
Polygon Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_506-2openalex-snapshot
Polygon Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_19openalex-snapshot
Computing the Visibility Polygon of an Island in a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-34531-9_105openalex-snapshot
Ear-Clipping Based Algorithms of Generating High-Quality Polygon Triangulation
inferred← citeshttps://doi.org/10.1007/978-3-642-36763-2_27openalex-snapshot
Covering Paths for Planar Point Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_14openalex-snapshot
Beacon-Based Algorithms for Geometric Routing
inferred← citeshttps://doi.org/10.1007/978-3-642-40104-6_5openalex-snapshot
Distance-Sensitive Planar Point Location
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_2openalex-snapshot
Geodesic-Preserving Polygon Simplification
inferred← citeshttps://doi.org/10.1007/978-3-642-45346-5_6openalex-snapshot
Polygon-Constrained Motion Planning Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-60718-9_22openalex-snapshot
Construction Of The Constrained Delaunay Triangulation Of A Polygonal Domain
inferred← citeshttps://doi.org/10.1007/978-3-658-37711-3_4openalex-snapshot
Durchschnitte, Zerlegungen und Sichtbarkeit
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_77openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.1007/978-3-7091-6586-7_11openalex-snapshot
Piecewise Linear Approximation of Planar Jordan Curves and Arcs: Theory and Applications
inferred← citeshttps://doi.org/10.1007/978-3-7091-7517-0_1openalex-snapshot
Data—Dependent Surface Simplification
inferred← citeshttps://doi.org/10.1007/978-81-322-2247-7_56openalex-snapshot
Advancement in Guard Zone Computation Through Detection and Exclusion of the Overlapped Regions
inferred← citeshttps://doi.org/10.1007/978-81-322-2653-6_18openalex-snapshot
An Algorithm to Solve 3D Guard Zone Computation Problem
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_28openalex-snapshot
Shortcutting the Diameter of a Polygon
inferred← citeshttps://doi.org/10.1007/bf00536457openalex-snapshot
What does Halobacterium tell us about photoreception?
inferred← citeshttps://doi.org/10.1007/bf01206329openalex-snapshot
A linear-time algorithm for constructing a circular visibility diagram
inferred← citeshttps://doi.org/10.1007/bf01206332openalex-snapshot
Optimal parallel algorithms for rectilinear link-distance problems
inferred← citeshttps://doi.org/10.1007/bf01293668openalex-snapshot
Finding a closest visible vertex pair between two polygons
inferred← citeshttps://doi.org/10.1007/bf01377183openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferred← citeshttps://doi.org/10.1007/bf01471937openalex-snapshot
Evaluating part designs for automatic feeding in robotic assembly systems: A geometric analysis of the nesting of polyhedral objects
inferred← citeshttps://doi.org/10.1007/bf01758855openalex-snapshot
Minimum-link paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf01910634openalex-snapshot
An algorithm for recognizing palm polygons
inferred← citeshttps://doi.org/10.1007/bfb0015405openalex-snapshot
Computing in linear time a chord from which a simple polygon is weakly internally visible
inferred← citeshttps://doi.org/10.1007/bfb0015442openalex-snapshot
Illumination with orthogonal floodlights
inferred← citeshttps://doi.org/10.1007/bfb0015444openalex-snapshot
Finding the medial axis of a simple polygon in linear time
inferred← citeshttps://doi.org/10.1007/bfb0028282openalex-snapshot
An optimal algorithm for computing visibility in the plane
inferred← citeshttps://doi.org/10.1007/bfb0049414openalex-snapshot
Optimal shortest path and minimum-link path queries in the presence of obstacles
inferred← citeshttps://doi.org/10.1007/pl00009159openalex-snapshot
Trekking in the Alps Without Freezing or Getting Tired
inferred← citeshttps://doi.org/10.1007/pl00009199openalex-snapshot
A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains
inferred← citeshttps://doi.org/10.1007/pl00009429openalex-snapshot
Finding the Medial Axis of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1007/s00224-020-09999-0openalex-snapshot
Computing the k-Visibility Region of a Point in a Polygon
inferred← citeshttps://doi.org/10.1007/s00371-006-0025-3openalex-snapshot
Methods and data structures for virtual world exploration
inferred← citeshttps://doi.org/10.1007/s00371-011-0670-zopenalex-snapshot
Algorithms for computing diffuse reflection paths in polygons
inferred← citeshttps://doi.org/10.1007/s00453-001-0028-4openalex-snapshot
FIST: Fast Industrial-Strength Triangulation of Polygons
inferred← citeshttps://doi.org/10.1007/s00453-002-0939-8openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/s00453-005-1191-9openalex-snapshot
Approximate unions of lines and minkowski sums
inferred← citeshttps://doi.org/10.1007/s00453-006-1208-zopenalex-snapshot
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
inferred← citeshttps://doi.org/10.1007/s00453-010-9430-0openalex-snapshot
Preprocessing Imprecise Points for Delaunay Triangulation: Simplified and Extended
inferred← citeshttps://doi.org/10.1007/s00453-013-9790-3openalex-snapshot
Monotone Drawings of Graphs with Fixed Embedding
inferred← citeshttps://doi.org/10.1007/s00453-014-9893-5openalex-snapshot
Space–Time Trade-offs for Stack-Based Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-015-0058-yopenalex-snapshot
Computing the Visibility Polygon of an Island in a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/s00453-016-0263-3openalex-snapshot
Geometric Path Problems with Violations
inferred← citeshttps://doi.org/10.1007/s00453-018-00536-7openalex-snapshot
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams
inferred← citeshttps://doi.org/10.1007/s00453-018-00540-xopenalex-snapshot
Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/s00453-018-0446-1openalex-snapshot
An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
inferred← citeshttps://doi.org/10.1007/s00453-019-00558-9openalex-snapshot
A New Balanced Subdivision of a Simple Polygon for Time-Space Trade-Off Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-019-00624-2openalex-snapshot
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00453-020-00769-5openalex-snapshot
On Orthogonally Guarding Orthogonal Polygons with Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/s004530010042openalex-snapshot
A Unified Approach to Conic Visibility
inferred← citeshttps://doi.org/10.1007/s00454-001-0027-xopenalex-snapshot
A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1007/s00454-001-0082-3openalex-snapshot
Explicit and Efficient Formulas for the Lattice Point Count in Rational Polygons Using Dedekind—Rademacher Sums
inferred← citeshttps://doi.org/10.1007/s00454-002-2886-1openalex-snapshot
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
inferred← citeshttps://doi.org/10.1007/s00454-004-1091-9openalex-snapshot
Allocating Vertex ?-Guards in Simple Polygons via Pseudo-Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-005-1184-0openalex-snapshot
Acute Triangulations of Polygons
inferred← citeshttps://doi.org/10.1007/s00454-009-9164-4openalex-snapshot
Fast Enumeration Algorithms for Non-crossing Geometric Graphs
inferred← citeshttps://doi.org/10.1007/s00454-010-9269-9openalex-snapshot
Conformal Mapping in Linear Time
inferred← citeshttps://doi.org/10.1007/s00454-011-9338-8openalex-snapshot
Representing a Functional Curve by Curves with Fewer Peaks
inferred← citeshttps://doi.org/10.1007/s00454-011-9346-8openalex-snapshot
Computing Hereditary Convex Structures
inferred← citeshttps://doi.org/10.1007/s00454-013-9563-4openalex-snapshot
Covering Paths for Planar Point Sets
inferred← citeshttps://doi.org/10.1007/s00454-016-9785-3openalex-snapshot
A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-016-9796-0openalex-snapshot
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00454-017-9918-3openalex-snapshot
Recognizing Weakly Simple Polygons
inferred← citeshttps://doi.org/10.1007/s00454-026-00831-zopenalex-snapshot
Optimal Triangulation of Polygons
inferred← citeshttps://doi.org/10.1007/s004540010078openalex-snapshot
An addition to art galleries with interior walls
inferred← citeshttps://doi.org/10.1007/s007910050042openalex-snapshot
Gradient and curvature approximation in data–dependent surface simplification
inferred← citeshttps://doi.org/10.1007/s10878-022-00846-1openalex-snapshot
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1016/0020-0190(09)60016-8openalex-snapshot
Algorithms for deciding the containment of polygons
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90014-mopenalex-snapshot
Special subgraphs of weighted visibility graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00220-sopenalex-snapshot
An optimal algorithm for finding the edge visibility polygon under limited visibility
inferred← citeshttps://doi.org/10.1016/0020-0190(94)90100-7openalex-snapshot
Computing a median point of a simple rectilinear polygon
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00115-8openalex-snapshot
A multifacility location problem on median spaces
inferred← citeshttps://doi.org/10.1016/0166-218x(96)80467-7openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/0166-3615(95)80005-0openalex-snapshot
Application of computational geometry in optimizing 2.5D and 3D NC surface machining
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90088-wopenalex-snapshot
Minimum vertex hulls for polyhedral domains
inferred← citeshttps://doi.org/10.1016/0898-1221(94)90152-xopenalex-snapshot
Geometric classification of triangulations and their enumeration in a convex polygon
inferred← citeshttps://doi.org/10.1016/0921-8890(95)00042-9openalex-snapshot
Landmark selection strategies for path execution
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90003-wopenalex-snapshot
Computing bushy and thin triangulations
inferred← citeshttps://doi.org/10.1016/0925-7721(91)90012-4openalex-snapshot
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90004-copenalex-snapshot
Dynamic output-sensitive hidden surface removal for c-oriented polyhedra
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90018-nopenalex-snapshot
Hamiltonian triangulations and circumscribing polygons of disjoint line segments
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90028-5openalex-snapshot
On compatible triangulations of simple polygons
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90031-zopenalex-snapshot
Linear-time algorithms for weakly-monotone polygons
inferred← citeshttps://doi.org/10.1016/0925-7721(94)90010-8openalex-snapshot
Computing minimum length paths of a given homotopy class
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00008-9openalex-snapshot
Generalized hidden surface removal
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00022-2openalex-snapshot
On a class of O(n2) problems in computational geometry
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00032-1openalex-snapshot
Finding a shortest diagonal of a simple polygon in linear time
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00042-9openalex-snapshot
LR-visibility in polygons
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00047-xopenalex-snapshot
Geometric pattern matching under Euclidean motion
inferred← citeshttps://doi.org/10.1016/0925-7721(96)00014-4openalex-snapshot
Generalized guarding and partitioning for rectilinear polygons
inferred← citeshttps://doi.org/10.1016/b978-0-08-102993-0.00002-3openalex-snapshot
Software algorithm and route planning
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50011-5openalex-snapshot
Geometric Data Structures
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50012-7openalex-snapshot
Polygon Decomposition
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50013-9openalex-snapshot
Link Distance Problems
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50019-xopenalex-snapshot
Parallel Computational Geometry: An Approach using Randomization
showing the first 200 of 562 · page through all 562
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.