• Computer Science
  • Published 1997

Computing the Minkowski Sum of Monotone Polygons

@inproceedings{HernndezBarrera1997ComputingTM,
  title={Computing the Minkowski Sum of Monotone Polygons},
  author={Antonio Hern{\'a}ndez-Barrera},
  year={1997}
}

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

A cost-optimal algorithm for guard zone computation including detection and exclusion of overlapping

  • 2015 19th International Symposium on VLSI Design and Test
  • 2015
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Minkowski Sums of Simple Polygons

VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

An innovative approach towards detection and exclusion of overlapped regions in guard zone computation

  • Proceedings of the 2015 Third International Conference on Computer, Communication, Control and Information Technology (C3IT)
  • 2015
VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

A time-optimal algorithm for guard zone problem

  • TENCON 2007 - 2007 IEEE Region 10 Conference
  • 2007
VIEW 1 EXCERPT
CITES BACKGROUND

Minkowski Sums of Monotone and General Simple Polygons

  • Discrete & Computational Geometry
  • 2006
VIEW 2 EXCERPTS
CITES BACKGROUND

Hyperpolygons generated by the invertible Minkowski sum of polygons

  • Pattern Recognition Letters
  • 2004
VIEW 2 EXCERPTS
CITES METHODS