Decomposing polygonal regions into convex quadrilaterals

@inproceedings{Lubiw1985DecomposingPR,
  title={Decomposing polygonal regions into convex quadrilaterals},
  author={Anna Lubiw},
  booktitle={SCG '85},
  year={1985}
}
  • A. Lubiw
  • Published in SCG '85 1 June 1985
  • Mathematics
A potygonat region is a closed region of the plane formed by cutting holes bounded by polygons out of a region bounded by a polygon. Vertices [e@es] of a polygonal region are vertices [edges] of the bounding polygon and the hole polygons. A chord of a polygonal region is a line segment inside the region joining two vertices. Decomposing a polygonal region into quadrilaterals means adding chords, no two of which cross, so that the minimal regions formed by the chords and edges are quadrilaterals… 

Minimum strictly convex quadrangulations of convex polygons

We present a linear–time algorithm that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals. Moreover, we characterize the polygons that can b e decomposed

Quadrangular Refinements of Convex Polygons with an Application to Finite-Element Meshes

A linear–time algorithm is presented that decomposes a convex polygon conformally into a minimum number of strictly convex quadrilaterals and proves that the problem of constructing a minimum conformal refinement of a mesh in the three–dimensional space is strongly –hard.

Quadrangulations of Planar Sets

Not all polygons or sets of points admit quadrangulations, even when the quadrangles are not required to be convex, as well as some related computational problems.

Minimum Weight Convex Quadrangulationof a Constrained Point

A convex quadrangulation with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of

Computing conforming partitions of orthogonal polygons with minimum stabbing number

Minimum Convex Partitions of Polygonal Domains

In this chapter we study a certain type of problems on partition of planar polygonal domains into a minimum number of convex pieces. More exactly, for a given family F of non-oriented directions in

Constrained quadrilateral meshes of bounded size

A new algorithm to convert triangular meshes of polygonal regions, with or without holes, into strictly convex quadrilateral meshes of small bounded size is introduced and an evaluation of the quality of these meshes with respect to a quadRilateral shape quality criterion is presented.

Converting triangulations to quadrangulations

Small Strictly Convex Quadrilateral Meshes of Point Sets

It is shown that 3\lfloorn/2\rfloor internal Steiner points are always sufficient for a convex quadrilateral mesh of n points in the plane.

DRAFT : Minimum Weight Convex Quadrangulationof a Constrained Point

Extended Abstract Summary: A convex quadrangulation with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the
...

References

SHOWING 1-10 OF 19 REFERENCES

Decomposing a Polygon into Simpler Components

  • J. Keil
  • Computer Science
    SIAM J. Comput.
  • 1985
This paper considers decompositions which do not introduce Steiner points, and applies a technique for improving the efficiency of dynamic programming algorithms to achieve polynomial time algorithms for the problems of decomposing a simple polygon into the minimum number of each of the component types.

The Power of Non-Rectilinear Holes

Four multiconnected-polygon partition problems are shown to be NP-hard. bltroduction One of the main topics of computational geometry is the problem of optimally partitioning figures into simpler

Geometric intersection problems

  • M. ShamosDan Hoey
  • Computer Science, Mathematics
    17th Annual Symposium on Foundations of Computer Science (sfcs 1976)
  • 1976
An O(N log N) algorithm is given to determine whether any two intersect and use it to detect whether two simple plane polygons intersect and to show that the Simplex method is not optimal.

Traditional Galleries Require Fewer Watchmen

Chvatal’s watchman theorem shows if the walls of an art gallery form an n-sided polygon then at most $[ n /3 ]$ watchmen are needed to guard it, and that this number is best possible. In this paper

A short proof of Chvátal's Watchman Theorem

  • S. Fisk
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1978

Computers and Intractability: A Guide to the Theory of NP-Completeness

It is proved here that the number ofrules in any irredundant Horn knowledge base involving n propositional variables is at most n 0 1 times the minimum possible number of rules.

The Design and Analysis of Computer Algorithms

This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.

Data structures and network algorithms

  • R. Tarjan
  • Computer Science
    CBMS-NSF regional conference series in applied mathematics
  • 1983
This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.