Filters
Greedy triangulation improvement over lookahead search
Minimum weight triangulation [MWT] is defined as a triangulation with the minimal total edge length on the given planar point set. It is unknown whethwe it can be computed in polynomial time. The greedy triangulation
JC - Počítačový hardware a software
- 1999 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Precoloring extension in planar near-Eulerian-triangulations
We consider the 4-precoloring extension problem in planar near-Eulerian- triangulations, i.e., plane graphs where all faces except possibly for the outer one have length three, all vertices not incident with the outer face have even...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2023 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
The stochastic walk algorithms for point location in pseudo-triangulations
A pseudo-triangulation is a planar subdivision into polygons with three convex vertices, useful for ray shooting, visibility problems and kinetic collision detection. In this paper, we address the question of location in pseudo-...
JC - Počítačový hardware a software
- 2011 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A new visibility walk algorithm for point location in planar triangulation
Finding which triangle in a planar triangle mesh contains a query point is one of the most frequent tasks in computational geometry. Usually, a large number of point locations has to be performed, and so there is a need for fast algorithms r...
IN - Informatika
- 2012 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Construction of Pseudo-triangulation by Incremental Insertion
A pseudo-triangulation is a planar subdivision into pseudotriangles - polygons with three convex vertices, used mainly in motion planning problems in robotics. As it is a rather new concept, not too many algorithms to construct it e...
JC - Počítačový hardware a software
- 2011 •
- D
Rok uplatnění
D - Stať ve sborníku
Walking algorithms for point location in TIN models
Finding which triangle in a planar or 2.5D triangle mesh contains a query point when working with triangulated irregular network models. Usually, a large number in the triangulation. So-called walking algorithms offer low c...
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Reconstructing domain boundaries within a given set of points, using Delaunay triangulation
Given an input set of planar points, which occupy a non-convex polygon area, possibly with holes, we reconstruct the shape of its boundary domain, without previous knowledge of which points or edges belong to the boundary. Our approach is ba...
JC - Počítačový hardware a software
- 2006 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Kinetic locally minimal triangulation: theoretical evaluation and combinatorial analysis
, we define the kinetic locally minimal triangulation (KLMT) as a kinetic data structure extension to the locally minimal triangulation in the Euclidean plane. We triangulation showing that KLMT may provide some benefits ov...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Adaptive Solution of Laplace Equation
The method of aposteriori error estimation based on weighted averaging to improve initial triangulation to get better solution of the planar elliptic boundary-value problem of second order is presented. Numerical illustrations of th...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Maximum angle condition for n-dimensional simplicial elements
In this paper the Synge maximum angle condition for planar triangulations is generalized for higher-dimensional simplicial partitions. In addition, optimal interpolation properties are presented for linear simplicial elements which ...
Pure mathematics
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
- 1 - 10 out of 4 890