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”
EN
ČeštinaEnglish

Filters

8 102 (0,098s) •

Result

Neighbourhood Graphs and Locally Minimal Triangulations

of neighbourhood graphs are subsets of Delaunay triangulation (DT) and this relation can of neighbourhood graphs to the locally minimal triangulation (LMT) and shows that, althoughNeighbourhood (or proximity) ...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2018
    • •
  • D
    • •
  • Link
Result

Rainbow cycles in flip graphs

The flip graph of triangulations has as vertices all triangulations of a convex n-gon and an edge between any two triangulations that differ in exactly one edge. An r-rainbow cycle in this graph is a cycle...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2020
    • •
  • Jimp
    • •
  • Link
Result

Nearest Neighbour Graph and Locally Minimal Triangulation

Nearest neighbour graph (NNG) is a useful tool namely for collision detection tests. It is well known that NNG, when considered as an undirected graph, is a subgraph of Delaunay triangulation and this relation can be used f...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2017
    • •
  • D
    • •
  • Link
Result

An experimental comparison of triangulation heuristics on transformed BN2O networks

triangulation heuristics on bipartite graphs. Our motivation for testing heuristics on the family of bipartite graphs is the rank-one decomposition of BN2O networks. A BN2O a triangulation of the BROD graph

IN - Informatika

  • 2009
    • •
  • D
Result

All roads lead to Rome ? New search methods for optimal triangulations

We investigate new methods for depth-first search and best-first search for finding optimal total table size triangulations. The search methods are made faster by efficient dynamic maintenance of the cliques of a graph....

BD - Teorie informace

  • 2010
    • •
  • D
Result

Flips in combinatorial pointed pseudo-triangulations with face degree at most four

In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or 4, so-called combinatorial 4-PPTs. We show that every combinatorial 4-PPT is stretchable to a geometric pseudo-triang...

BA - Obecná matematika

  • 2014
    • •
  • Jx
    • •
  • Link
Result

All roads lead to Rome - New search methods for the optimal triangulation problem

method, the network graph needs to be triangulated. The quality of this triangulation largely determines the efficiency of the subsequent inference, but the triangulation the treewidth criterion for optimality of ...

BD - Teorie informace

  • 2012
    • •
  • Jx
    • •
  • Link
Result

Polynomial bounds on geometric Ramsey numbers of ladder graphs

We prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n^3) and O(n^10), in the convex and general case, respectively. We also prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 o...

BA - Obecná matematika

  • 2013
    • •
  • D
    • •
  • Link
Result

Multi-path algorithm for triangle strips

We present a new stripification algorithm for static fully triangulated meshes. Our new algorithm is based on the dual graph of triangulation. Our stripification produces much lower number of triangle strips than other stri...

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

  • 2004
    • •
  • D
Result

Upper bound theorem for odd-dimensional flag triangulations of manifolds

We prove that among all flag triangulations of manifolds of odd dimension 2r-1 with sufficiently many vertices the unique maximizer of the entries of the f-, h-, g- and gamma-vector is the balanced join of r cycles. Our proof uses methods fr...

Pure mathematics

  • 2016
    • •
  • Jimp
    • •
  • Link
  • 1 - 10 out of 8 102