691 search results - page 23 / 139 » Axiomatizing geometric constructions |
115
click to vote
AAECC
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Let C be an algebraic geometric code of dimension k and length n constructed on a curve X over Fq. Let s(C) be the state complexity of C and set w(C) := min{k, n-k}, the ...
168
Voted
ICPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Two-dimensional and three-dimensional coordinate systems are the basic graphics symbols in many graphical documents. A robust coordinate system detection scheme is needed in order...
120
Voted
FUN
2007
Springer
15 years 11 months ago
2007
Springer
We discuss some new geometric puzzles and the complexity of their extension to arbitrary sizes. For gate puzzles and two-layer puzzles we prove NP-completeness of solving them. No...
165
Voted
STACS
2007
Springer
15 years 11 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
142
Voted
ESA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The construction of t-spanners of a given point set has received a lot of attention, especially from a theoretical perspective. In this paper we perform the first extens...