Results 11  20
of
1,587
Subgraph Isomorphism in Planar Graphs and Related Problems
, 1999
"... We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small treewidth, and applying dynamic programming within each piece. The same methods can be used to ..."
Abstract

Cited by 150 (2 self)
 Add to MetaCart
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small treewidth, and applying dynamic programming within each piece. The same methods can be used
Recognition of Planar Object Classes
 In Proc. IEEE Comput. Soc. Conf. Comput. Vision and Pattern Recogn
, 1996
"... We present a new framework for recognizing planar object classes, which is based on local feature detectors and a probabilistic model of the spatial arrangement of the features. The allowed object deformations are represented through shape statistics, which are learned from examples. Instances of an ..."
Abstract

Cited by 80 (12 self)
 Add to MetaCart
We present a new framework for recognizing planar object classes, which is based on local feature detectors and a probabilistic model of the spatial arrangement of the features. The allowed object deformations are represented through shape statistics, which are learned from examples. Instances
Localized hexagon patterns of the planar SwiftHohenberg equation
 SIAM J. Appl. Dyn. Syst
"... We investigate stationary spatially localized hexagon patterns of the twodimensional Swift–Hohenberg equation in the parameter region where the trivial state and regular hexagon patterns are both stable. Using numerical continuation techniques, we trace out the existence regions of fully localized ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
hexagon patches and of planar pulses which consist of a strip filled with hexagons that is embedded in the trivial state. We find that these patterns exhibit snaking: for each parameter value in the snaking region, an infinite number of patterns exist that are connected in parameter space and whose width
Which Pattern? Biasing Aspects of Planar Calibration Patterns and Detection Methods Abstract
"... This paper provides a comparative study on the use of planar patterns in the generation of control points for camera calibration. This is an important but often neglected aspect in camera calibration. Two popular checkerboard and circular dot patterns are each examined with two detection strategies ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
This paper provides a comparative study on the use of planar patterns in the generation of control points for camera calibration. This is an important but often neglected aspect in camera calibration. Two popular checkerboard and circular dot patterns are each examined with two detection strategies
Colourings of planar quasicrystals
 J. ALLOYS AND COMPOUNDS
, 2001
"... The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and determines the actual colour symmetry groups. Continuing previous ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
work, we present the results of the combinatorial part for planar patterns with nfold symmetry, where n = 7,9,15,16,20,24. This completes the cases with φ(n) ≤ 8, where φ is Euler’s totient function.
Planar coincidences for Nfold symmetry
, 2005
"... The coincidence problem for planar patterns with Nfold symmetry is considered. For the Nfold symmetric module with N < 46, all isometries of the plane are classified that result in coincidences of finite index. This is done by reformulating the problem in terms of algebraic number fields and us ..."
Abstract

Cited by 19 (11 self)
 Add to MetaCart
The coincidence problem for planar patterns with Nfold symmetry is considered. For the Nfold symmetric module with N < 46, all isometries of the plane are classified that result in coincidences of finite index. This is done by reformulating the problem in terms of algebraic number fields
The Relative Neighbourhood Graph of a Finite Planar Set,”
 in PR,
, 1980
"... Abstract The relative neighbourhood graph (RNG) of a set of n points on the plane is defined. The ability of the RNG to extract a perceptually meaningful structure from the set of points is briefly discussed and compared to that of two other graph structures: the minimal spanning tree (MST) and th ..."
Abstract

Cited by 100 (1 self)
 Add to MetaCart
. Finally, several open problems concerning the RNG in several areas such as geometric complexity, computational perception, and geometric probability, are outlined. Relative neighbourhood graph Minimal spanning tree Triangulations Delaunay triangulation Dot patterns Computational perception Pattern
Matching Planar Maps
"... The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g. computer vision, geographic information systems, etc. More precisely, we will define feasible distance measures that reflect how close a given pattern H is to ..."
Abstract

Cited by 54 (14 self)
 Add to MetaCart
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g. computer vision, geographic information systems, etc. More precisely, we will define feasible distance measures that reflect how close a given pattern H
Planar Grouping for Automatic Detection of Vanishing Lines and Points
 Image and Vision Computing
, 2000
"... It is demonstrated that grouping together features which satisfy a geometric relationship can be used both for (automatic) detection and estimation of vanishing points and lines. We describe the geometry of three commonly occurring types of geometric grouping and present efficient grouping algorithm ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
algorithms which exploit these geometries. The three types of grouping are : (1) a family of equally spaced coplanar parallel lines, (2) a planar pattern obtained by repeating some element by translation in the plane, and (3) a set of elements arranged in a regular planar grid. Examples of automatically
Waveguiding in planar photonic crystals
 Appl. Phys. Lett
, 2000
"... Abstract—We analyze, in three dimensions, the dispersion properties of dielectric slabs perforated with twodimensional photonic crystals (PCs) of square symmetry. The band diagrams are calculated for allvectors in the first Brillouin zone, and not only along the characteristic highsymmetry dire ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
symmetry directions. We have analyzed the equalfrequency contours of the first two bands, and we found that the square lattice planar photonic crystal is a good candidate for the selfcollimation of light beams. We map out the group velocities for the second band of a square lattice planar PC and show
Results 11  20
of
1,587