Publication | Closed Access
Allowed Boundary Sequences for Fused Polycyclic Patches and Related Algorithmic Problems
22
Citations
6
References
2001
Year
EngineeringGeometryRelated Algorithmic ProblemsPlanar Hexagonal SequencesComputational TopologyDiscrete GeometryDiscrete MathematicsCombinatorial OptimizationComputational GeometryGeometric ModelingComputer ScienceFused PolycyclesAllowed Boundary SequencesBoundary CircuitsGeometric AlgorithmPolycyclic PatchesNatural SciencesDiscrete Differential GeometryDelaunay TriangulationTopological Combinatorics
We consider sequences that encode boundary circuits of fused polycycles made up of polygonal faces with p sides, p < or = 6. We give a constructive algorithm for recognizing such sequences when p = 5 or 6. A simpler algorithm is given for planar hexagonal sequences. Hexagonal and pentagonal sequences of length at most 8 are tabulated, the former corresponding to planar benzenoid hydrocarbons CxHy with y up to 14.
| Year | Citations | |
|---|---|---|
Page 1
Page 1