Filters
Star polygons
The paper deals with the so-called star polygons. A star polygon is a type of non-convex polygons created by connecting with straight lines regularly spaced points lying on a circle....
Education, general; including training, pedagogy, didactics [and education systems]
- 2018 •
- Jost
Rok uplatnění
Jost - Ostatní články v recenzovaných periodicích
Affine invariants of convex polygons.
Affine Invariants of Convex Polygons - definition, independence, and other properties.
JD - Využití počítačů, robotika a její aplikace
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
A sufficient condition for the existence of large empty convex polygons
A sufficient condition for the existence of large empty convex polygons...
BA - Obecná matematika
- 2002 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision
New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to ??1? run-time complexity....
JC - Počítačový hardware a software
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
A Point in Non-Convex Polygon Location Problem Using the Polar Space Subdivision in E2
The point inside/outside a polygon test is used by many applications is repeated several times with the same polygon a data structure is necessary in order intersections with polygon edges, and the time complexity of the pr...
IN - Informatika
- 2015 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Planar point sets with a small number of empty convex polygons
We constructs sets of n points in the plane with a small number of empty polygons.
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Empty convex polygons in almost convex sets
A finite set of points, in general position in the plane, is almost convex if every triple determines a triangle with at most one point in its interior. For every -; [.gt.] 3, we determine the maximum size of an almost convex set th...
BA - Obecná matematika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Polar, Spherical and Orthogonal Space Subdivisions for an Algorithm Acceleration: O(1) Point-in-Polygon/Polyhedron Test
The presented polar, spherical and orthogonal space subdivision approach leads to significant speed up of geometric algorithm. The approach is applied to point-in-convex polygon and point-in-convex polyhedron test leading t...
JC - Počítačový hardware a software
- 2015 •
- D
Rok uplatnění
D - Stať ve sborníku
A Novel Line Convex Polygon Clipping Algorithm in E2 with Parallel Processing Modification
This paper presents a new approach to line clipping by a convex polygon problem solution. The algorithm is based on a separation function, which separates the polygon vertices to the left or right hand side of the given lin...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2021 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Reachability by paths of bounded curvature in convex polygons
Motion planning for a car-like robot moving forward with bounded turning radius inside a convex polygon is studied, and the reachable region is characterized....
BD - Teorie informace
- 2000 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 86 160