This article builds a mathematical model using dual‑landmark triangulation and perspective geometry to estimate the distance of a PLA drone that captured a high‑resolution image of Taipei 101, providing calculations, error analysis, and confidence intervals for the drone’s range.
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.
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.
This article explains how short‑video apps render text on the GPU by converting characters into GPU‑friendly primitives, covering image‑based text, triangulated glyphs, vector rendering extensions, and signed distance field methods, along with their advantages, drawbacks, and practical libraries.
