Keyword: computational geometry

Found 5 papers in total
Identifying Shapes Using Self‐assembly
Identifying Shapes Using Self‐assembly
2012,
In this paper, we introduce the following problem in the theory of algorithmic...
Complexity of Finding Graph Roots with Girth Conditions
Complexity of Finding Graph Roots with Girth Conditions
2012,
Graph G is the square of graph H if two vertices x , y have an edge in G if and only...
The Parameterized Complexity of Stabbing Rectangles
The Parameterized Complexity of Stabbing Rectangles
2012,
The NP‐complete geometric covering problem Rectangle Stabbing is defined as...
Polygonal Representations of Digital Sets
Polygonal Representations of Digital Sets
2004,
In the context of discrete curve evolution the following problem is of relevance:...
A geometric connection to threshold logic via cubical lattices
A geometric connection to threshold logic via cubical lattices
2011,
A cut‐complex is a cubical complex whose vertices are strictly separable from...
Papers per page: