Topic
Bowyer–Watson algorithm
About: Bowyer–Watson algorithm is a research topic. Over the lifetime, 1648 publications have been published within this topic receiving 55593 citations.
Papers published on a yearly basis
Papers
2 Jul 1997
TL;DR: An image coding technique that combines irregular subsampling and triangulation is proposed, and simulation results show the superiority of the proposed algorithm over JPEG at low bit rates as well as its robustness.
Abstract: An image coding technique that combines irregular subsampling and triangulation is proposed. First, a Delaunay triangulation is constructed over a set of visually significant sampling points selected incrementally as the triangulation progresses. Then a data-dependent triangulation is generated, starting from the Delaunay triangulation, by a series of edge swaps based on the quality of the approximation. Bilinear interpolation is used to approximate the triangular regions. The simulation results show the superiority of the proposed algorithm over JPEG at low bit rates (0.206 bpp and 0.113 bpp) as well as its robustness.
5 citations
TL;DR: This paper proposes a new geometric-based mechanism for binary image dilation that exploits Delaunay triangulation; a versatile geometric structure that shows high performance when applied to handwritten digit classification and evaluates the property of object structure preservation by using common measurement metrics.
5 citations
TL;DR: It is shown that arbitrarily large point sets can have a single higher order Delaunay triangulation, even for large orders, whereas for first order Delahan triangulations, the maximum number is 2^n^-^3.
5 citations
Journal Article•
TL;DR: A simple correspondence approach in camera calibration is proposed based on Delaunay triangulation to automatically match the image coordinates with the world coordinates for feature points with regular grid network structure.
Abstract: A simple correspondence approach in camera calibration is proposed based on Delaunay triangulation to automatically match the image coordinates with the world coordinates for feature points with regular grid network structure.The topological structure of the feature points was generated by Delaunay triangulation and pretreatment which removes the redundant triangles.The correspondence between the image coordinates and world coordinates of feature points was implemented by using the topological structure.The experimental results show that the proposed approach is simple,robust,and not sensitive to lens distortion.The approach can still effectively implement the feature point correspondence when the pattern is viewed from an oblique angle and under occlusion condition.It is most suitable for on-line camera calibration.
5 citations
22 May 2011
TL;DR: An algorithm to simplify complex 2-D polygons based on Delaunay triangulation is presented, which can reduce more than 75% in total nodes in comparison with the approach without simplification, resulting in significant reduction of computer resources in numerical computation.
Abstract: As modern high speed Package Circuit Boards (PCBs) and Integrated Circuit (IC) packages become more and more complicated, the electromagnetic simulation inside the PCBs and IC packages becomes more and more difficult. The most challenge work is that complicated multiple layer shapes inside PCBs and IC packages need very huge amount of high quality meshes for electromagnetic simulation, which lead to huge memory requirement for solving the linear matrix. For most personal computers, that requirement usually lead to out of memory in matrix solution. To overcome this problem without losing the simulation precision, this article presents an algorithm to simplify complex 2-D polygons based on Delaunay triangulation. By checking the smallest angles of triangles which contain an edge of the polygons, the algorithm simplifies polygons adaptively and updates the simplified polygons' Delaunay triangulation. Different from other simplifications which try to decrease the count of vertices, this algorithm tries to delete redundant short edges, leading to greatly reduced mesh points during the process of generating the constrained and quality Delaunay triangulation. The algorithm presented here has been applied for mesh generation for finite-element analysis of complicated PCBs and IC packages. Test results show that the proposed algorithm can reduce more than 75% in total nodes in comparison with the approach without simplification, resulting in significant reduction of computer resources in numerical computation.
5 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2026 | 1 |
| 2025 | 6 |
| 2024 | 17 |
| 2023 | 10 |
| 2022 | 26 |
| 2021 | 1 |