1009 search results - page 96 / 202 » On Indexing Line Segments |
IVC
2007
13 years 10 months ago
2007
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
ASPDAC
1995
ACM
14 years 1 months ago
1995
ACM
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
GD
2009
Springer
14 years 1 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
CAISE
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Specification of systems in a software product line (product-line members) is often supported by domain-specific languages (DSLs) that provide pownguage abstractions for ...