All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

1 363 (0,145s)

Result

Decomposition of Polygons

Properties of planar and scew polygons are investigated. It is shown that every polygon can bee express in the form of the sum of regular polygons. The situation is demonstrated on computer aided by Cabri geometry....

BA - Obecná matematika

  • 2000
  • D
Result

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
Result

The Harmonic Analysis of Polygons and Napoleon´s Theorem

The relation between the Harmonic analysis of polygons and the well-known Napoleon´s theorem is given. A geometrical approach of how to find fundamental polygons of every planar or skew polygon is found....

BA - Obecná matematika

  • 2001
  • Jx
Result

A lower bound for proportion of visibility polygon's surface to entire polygon's surface: Estimated by Art Gallery Problem and proven that cannot be greatly improved

Main topics of the document: visibility polygon; visibility polygon's surface; lower bound estimation; estimation effectiveness; art gallery problem......

Pure mathematics

  • 2023
  • D
  • Link
Result

Automatic polygon layers integration and its implementation

The paper deals with automatic integration of polygon layers for detecting actual temporal land cover changes. The python/arcpy tool developed within the study integrates polygon layers by identifying and unifying similar polygo...

GK - Lesnictví

  • 2012
  • Jx
  • Link
Result

<> cell-based point-in-polygon algorithm suitable for large sets of points

The paper describes a new algorithm for solving the point-in-polygon problem. It is especially suitable when it is necessary to check whether many points are placed inside or outside a polygon. The algorithm works with O/n/ space co...

JC - Počítačový hardware a software

  • 2001
  • Jx
Result

A harmonic analysis of polygons

A survey of a harmonic analysis of polygons is given. The problems are solved also in a space.

BA - Obecná matematika

  • 2005
  • Jx
Result

On the Number of Intersections of Polygons

We show an upper bound on the number of intersection of boundaries of two polygons...

BA - Obecná matematika

  • 2003
  • Jx
Result

Counting polygons

Algorithm for analytic and computed assisted counting of polygons generated by randomly distributed points is presented.

Applied mathematics

  • 2021
  • Jost
Result

Accelerated edge spinning algorithm for implicit surfaces

This paper presents a new fast modification of Edge spinning method. The algorithm puts emphasis on the quality of polygonal mesh and on the polygonization speed. This paper presents a new fast modification of Edge spinning method. ...

JC - Počítačový hardware a software

  • 2002
  • D
  • 1 - 10 out of 1 363