computational geometry

Bilibili Tech

Mar 17, 2023 · Game Development

Triangulation of Vector Graphics: Polygon Decomposition and Monotone Polygon Algorithms

This article explains how to convert vector‑graphics paths into GPU‑ready triangles by approximating Bézier curves with poly‑lines, simplifying self‑intersecting polygons using the Bentley‑Ottmann sweep‑line algorithm, decomposing simple polygons into monotone pieces, and finally triangulating those monotone polygons.

Bentley-OttmannBézier curvesGPU rendering

0 likes · 21 min read

Triangulation of Vector Graphics: Polygon Decomposition and Monotone Polygon Algorithms

Model Perspective

Mar 10, 2023 · Fundamentals

Unlocking the Shoelace Theorem: Fast Polygon Area Calculation Explained

This article explores the “push‑step aggregation” technique featured in the drama “Microscope under the Ming,” revealing that it is essentially the Shoelace Theorem for quickly computing polygon areas, complete with mathematical derivation, visual illustrations, and a Python implementation.

Shoelace theoremalgorithmcomputational geometry

0 likes · 8 min read

Unlocking the Shoelace Theorem: Fast Polygon Area Calculation Explained

New Oriental Technology

Jun 3, 2021 · Fundamentals

Polygon Decomposition, Triangulation, and Convex Decomposition Algorithms

This article explains the concepts of polygons, including simple, convex, and concave types, describes vertex visibility, ear clipping, and various algorithms for polygon triangulation and convex decomposition, discussing their complexities and practical considerations.

Polygonalgorithmscomputational geometry

0 likes · 11 min read

Polygon Decomposition, Triangulation, and Convex Decomposition Algorithms

360 Tech Engineering

Jun 16, 2020 · Fundamentals

Delaunay Triangulation: Definition, Properties, and Divide‑and‑Conquer Algorithm Implementation in TypeScript

This article explains the Delaunay triangulation concept, its geometric properties such as empty circumcircles and maximal minimum angles, and presents a detailed divide‑and‑conquer algorithm with step‑by‑step merging logic and a complete TypeScript code implementation.

Delaunay triangulationTypeScriptalgorithm

0 likes · 10 min read

Delaunay Triangulation: Definition, Properties, and Divide‑and‑Conquer Algorithm Implementation in TypeScript

Xueersi Online School Tech Team

Dec 27, 2019 · Fundamentals

Smallest Enclosing Circle Algorithm: Interview Story, Theory, and C Implementation

This article presents an interview case about finding the minimum enclosing circle of a planar point set, explains the geometric concepts, outlines a randomized incremental algorithm with correctness proof and complexity analysis, and provides a complete C implementation.

C programmingalgorithmcomplexity analysis

0 likes · 17 min read

Smallest Enclosing Circle Algorithm: Interview Story, Theory, and C Implementation