Polygon triangulation

The problem of minimum distance localization in environments that may contain self-similarities is addressed. A mobile robot is placed at an unknown location inside a 2D self-similar polygonal environment P. The robot has a map of P and can compute visibility data through sensing. However, the self-similarities in the environment mean that the same visibility data may correspond to several different locations.

6p vikoenigsegg 29-09-2022 11 2   Download

In this paper an algorithm for the convex polygon triangulation based on the reverse Polish notation is proposed. The formal grammar method is used as the starting point in the investigation. This idea is "translated" to the arithmetic expression field enabling application of the reverse Polish notation method.

7p vinguyentuongdanh 20-12-2018 25 1   Download

(bq) part 1 book "computational geometry - algorithms and applications" has contents: computational geometry, line segment intersection, polygon triangulation, linear programming, orthogonal range searching, point location, voronoi diagrams, arrangements and duality.

201p bautroibinhyen20 06-03-2017 41 4   Download