scispace - formally typeset
Journal ArticleDOI

Two algorithms for constructing a Delaunay triangulation

TLDR
This paper provides a unified discussion of the Delaunay triangulation and two algorithms are presented for constructing the triangulations over a planar set ofN points.
Abstract
This paper provides a unified discussion of the Delaunay triangulation. Its geometric properties are reviewed and several applications are discussed. Two algorithms are presented for constructing the triangulation over a planar set ofN points. The first algorithm uses a divide-and-conquer approach. It runs inO(N logN) time, which is asymptotically optimal. The second algorithm is iterative and requiresO(N 2) time in the worst case. However, its average case performance is comparable to that of the first algorithm.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Automatic Mesh Generation System for a Novel FEM Modeling Based on Fuzzy Theory

TL;DR: An automatic finite element (FE) mesh generation for three-dimensional structures consisting of free-form surfaces using the Delaunay method holds great benefits for analyses.
Book ChapterDOI

My Career and Contributions

TL;DR: I started my career earning a BA in Mathematics in 1965 from the Technion, Israel Institute of Technology and served a mandatory service in the military for an extended period of time so I could serve at the newly established computer center as a computer programmer.
Dissertation

OCT en phase pour la reconnaissance biométrique par empreintes digitales et sa sécurisation

TL;DR: In this paper, the authors propose an approach based on the Tomographique par Coherence Optique (TPCO) to construct a 3D capteur without contact, permettant de mesurer finement cette information.
Journal ArticleDOI

Graph-based visual odometry for VSLAM

TL;DR: A novel graph-based method that aims to improve matching accuracy by fully exploiting the structure information and is compared with several state-of-the-art visual simultaneous localization and mapping algorithms on three datasets.
Journal ArticleDOI

Blind 3D mesh watermarking based on cropping-resilient synchronization

TL;DR: This paper solves the synchronization problem in a blind environment which is a core part of the anti-cropping watermarking method using local shape-based synchronization and shows high robustness against common signal processing attacks as well as severe cropping attacks with high invisibility.
References
More filters
Book

Computational geometry

Proceedings ArticleDOI

Closest-point problems

TL;DR: The purpose of this paper is to introduce a single geometric structure, called the Voronoi diagram, which can be constructed rapidly and contains all of the relevant proximity information in only linear space, and is used to obtain O(N log N) algorithms for most of the problems considered.