Relevant bibliographies by topics / Monotone polygons

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Monotone polygons'

Author: Grafiati
Published: 24 April 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Monotone polygons.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Monotone polygons"

1

Berry, Lindsay, Andrew Beveridge, Jane Butterfield, et al. "Line-of-Sight Pursuit in Monotone and Scallop Polygons." International Journal of Computational Geometry & Applications 29, no. 04 (2019): 307–51. http://dx.doi.org/10.1142/s0218195919500122.

Full text
Abstract:
We study a turn-based game in a simply connected polygonal environment [Formula: see text] between a pursuer [Formula: see text] and an adversarial evader [Formula: see text]. Both players can move in a straight line to any point within unit distance during their turn. The pursuer [Formula: see text] wins by capturing the evader, meaning that their distance satisfies [Formula: see text], while the evader wins by eluding capture forever. Both players have a map of the environment, but they have different sensing capabilities. The evader [Formula: see text] always knows the location of [Formula:
APA, Harvard, Vancouver, ISO, and other styles
2

TAN, XUEHOU. "EDGE GUARDS IN STRAIGHT WALKABLE POLYGONS." International Journal of Computational Geometry & Applications 09, no. 01 (1999): 63–79. http://dx.doi.org/10.1142/s0218195999000066.

Full text
Abstract:
We study the art gallery problem restricted to edge guards and straight walkable polygons. An edge guard is the guard that patrols individual edges of the polygon. A simple polygon P is called straight walkable if there are two vertices s and t in P and we can move two points montonically on two polygonal chains of P from s to t, one clockwise and the other counterclockwise, such that two points are always mutually visible. For instance, monotone polygons and spiral polygons are straight walkable. We show that ⌊(n+2)/5⌋ edge guards are always sufficient to watch and n-vertex gallery of this ty
APA, Harvard, Vancouver, ISO, and other styles
3

Bose, Prosenjit, Pat Morin, Michiel Smid, and Stefanie Wuhrer. "Rotationally monotone polygons." Computational Geometry 42, no. 5 (2009): 471–83. http://dx.doi.org/10.1016/j.comgeo.2007.02.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aichholzer, Oswin, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, and Birgit Vogtenhuber. "Modem illumination of monotone polygons." Computational Geometry 68 (March 2018): 101–18. http://dx.doi.org/10.1016/j.comgeo.2017.05.010.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

CHEN, DANNY Z., XIAOBO S. HU, and XIAODONG WU. "OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS." International Journal of Computational Geometry & Applications 12, no. 04 (2002): 309–38. http://dx.doi.org/10.1142/s0218195902000918.

Full text
Abstract:
Polygon cover problems are important in several applied areas, such as material layout, layered manufacturing, radiation therapy and radiosurgery, etc. In this paper, we study three optimal polygon cover problems: monotone polygon cover among obstacles, star-shaped polygon cover among obstacles, and strip cover for trapezoidalized polygons. Based on some interesting geometric observations, we develop efficient algorithms for solving these problems. The complexity bounds of our monotone cover and star-shaped cover algorithms are comparable to those of the previously best known algorithms for si
APA, Harvard, Vancouver, ISO, and other styles
6

Lingas, Andrzej, Agnieszka Wasylewicz, and Paweł Żyliński. "Note on covering monotone orthogonal polygons with star-shaped polygons." Information Processing Letters 104, no. 6 (2007): 220–27. http://dx.doi.org/10.1016/j.ipl.2007.06.015.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Liu, Robin, and Simeon Ntafos. "On decomposing polygons into uniformly monotone parts." Information Processing Letters 27, no. 2 (1988): 85–89. http://dx.doi.org/10.1016/0020-0190(88)90097-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Heffernan, Paul J. "Linear-time algorithms for weakly-monotone polygons." Computational Geometry 3, no. 3 (1993): 121–37. http://dx.doi.org/10.1016/0925-7721(93)90031-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Krohn, Erik A., and Bengt J. Nilsson. "Approximate Guarding of Monotone and Rectilinear Polygons." Algorithmica 66, no. 3 (2012): 564–94. http://dx.doi.org/10.1007/s00453-012-9653-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

CHEN, DANNY Z., XIAOBO S. HU, SHUANG (SEAN) LUAN, CHAO WANG, and XIAODONG WU. "GEOMETRIC ALGORITHMS FOR STATIC LEAF SEQUENCING PROBLEMS IN RADIATION THERAPY." International Journal of Computational Geometry & Applications 14, no. 04n05 (2004): 311–39. http://dx.doi.org/10.1142/s0218195904001494.

Full text
Abstract:
The static leaf sequencing (SLS) problem arises in radiation therapy for cancer treatments, aiming to accomplish the delivery of a radiation prescription to a target tumor in the minimum amount of delivery time. Geometrically, the SLS problem can be formulated as a 3-D partition problem for which the 2-D problem of partitioning a polygonal domain (possibly with holes) into a minimum set of monotone polygons is a special case. In this paper, we present new geometric algorithms for a basic case of the 3-D SLS problem (which is also of clinical value) and for the general 3-D SLS problem. Our basi
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Monotone polygons"

1

Wei, Xiangzhi. "Monotone path queries and monotone subdivision problems in polygonal domains /." View abstract or full-text, 2010. http://library.ust.hk/cgi/db/thesis.pl?IELM%202010%20WEI.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chang, Bor Lun, and 張伯綸. "On Partitioning Simple Polygons into Uniformly Monotone Parts." Thesis, 1993. http://ndltd.ncl.edu.tw/handle/26848386704049795706.

Full text
Abstract:
碩士<br>國立交通大學<br>應用數學研究所<br>81<br>Decomposing polygons into simpler shapes is an important and interesting problem in computational geometry. In this thesis, we shall pay our attention to the problem of partitioning a simple polygon into the minimum number of uniformly monotone parts. In 1988, Liu and Ntafos proposed an .blksq. time algorithm to solve this problem. In this thesis, we shall propose an .blksq. time algorithm for this problem. Here n is the number of vertices and N is the numbe
APA, Harvard, Vancouver, ISO, and other styles
3

GIU, RUI-SHAN, and 邱瑞山. "A study on monotone polygon containment decision problems." Thesis, 1989. http://ndltd.ncl.edu.tw/handle/s22t98.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Monotone polygons"

1

Biedl, Therese C., Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, and Michael A. Soss. "Convexifying Monotone Polygons." In Algorithms and Computation. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-46632-0_42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Boland, Ralph P., and Jorge Urrutia. "Partitioning Polygons into Tree Monotone and Y -monotone Subpolygons." In Computational Science and Its Applications — ICCSA 2003. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44842-x_92.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chang, Yi-Jun, and Hsu-Chun Yen. "Rectilinear Duals Using Monotone Staircase Polygons." In Combinatorial Optimization and Applications. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12691-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aichholzer, Oswin, Mario Cetina, Ruy Fabila-Monroy, Jesús Leaños, Gelasio Salazar, and Jorge Urrutia. "Convexifying Monotone Polygons while Maintaining Internal Visibility." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34191-5_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nilsson, Bengt J. "Approximate Guarding of Monotone and Rectilinear Polygons." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11523468_110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Noori, Narges, and Volkan Isler. "Lion and Man with Visibility in Monotone Polygons." In Springer Tracts in Advanced Robotics. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-36279-8_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nilsson, Bengt J., David Orden, Leonidas Palios, Carlos Seara, and Paweł Żyliński. "Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58150-3_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Damaschke, Peter. "An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60313-1_171.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wagener, Hubert. "Triangulating a monotone polygon in parallel." In Computational Geometry and its Applications. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-50335-8_30.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ahn, Hee-Kap, Peter Brass, Christian Knauer, Hyeon-Suk Na, and Chan-Su Shin. "Covering a Simple Polygon by Monotone Directions." In Algorithms and Computation. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-92182-0_59.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Monotone polygons"

1

Pati, Kamaljit, Anandi Bharwani, Priyam Dhanuka, Manas Kumar Mohanty, and Sanjib Sadhu. "Monotone polygons using linked list." In 2015 International Conference on Advances in Computer Engineering and Applications (ICACEA). IEEE, 2015. http://dx.doi.org/10.1109/icacea.2015.7164644.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dhanuka, Priyam, Anandi Bharwani, Kamaljit Kaur, Manas Kumar Mohanty, and Sanjib Sadhu. "An alternative approach for computing monotone polygon." In 2015 International Conference on Advances in Computer Engineering and Applications (ICACEA). IEEE, 2015. http://dx.doi.org/10.1109/icacea.2015.7164710.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Varadarajan, Kasturi R. "Approximating monotone polygonal curves using the uniform metric." In the twelfth annual symposium. ACM Press, 1996. http://dx.doi.org/10.1145/237218.237400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bastien, J., C. H. Lamarque, and M. Schatzman. "Study of Some Rheological Elastoplastic Models With a Finite Number of Degrees of Freedom." In ASME 1999 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/detc99/vib-8081.

Full text
Abstract:
Abstract A large number of rheological models can be covered by the existence and uniqueness theory for maximal monotone operators. Numerical simulations display hysteresis cycles when the forcing is periodic. A given shape of hysteresis cycle in an appropriate class of polygonal cycles can always be realized by adjusting the physical parameters of the rheological model.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhanlong, Chen, Ma Lina, and Wu Liang. "Polygon Overlay Analysis Algorithm Based on Monotone Chain and STR Tree in the Simple Feature Model." In 2010 International Conference on Electrical and Control Engineering (ICECE). IEEE, 2010. http://dx.doi.org/10.1109/icece.2010.1420.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gao, Hanqiao, and Jorge Corte´s. "Spatial Detection of Areas of Abrupt Change by Robotic Networks." In ASME 2009 Dynamic Systems and Control Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/dscc2009-2760.

Full text
Abstract:
This paper studies robotic sensor networks performing spatial detection of areas of rapid change in physical phenomena. We encode the task by means of an objective function, called wombliness, which measures the change of the spatial field along the open polygonal curve defined by the positions of the robotic sensors. This curve can become self-intersecting when evolving along the gradient flow of the wombliness. Borrowing tools from discontinuous dynamics and hybrid systems, we design an algorithm that allows for network re-positioning, splitting, and merging, while guaranteeing the monotonic
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography