Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Polygons ). Showing records 1 – 30 of 156 total matches.

[1] [2] [3] [4] [5] [6]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of North Texas

1. Heinlein, David J. (David John). Properties of Bicentric Circles for Three-Sided Polygons.

Degree: 1998, University of North Texas

We define and construct bicentric circles with respect to three-sided polygons. Then using inherent properties of these circles, we explore both tangent properties, and areas generated from bicentric circles. Advisors/Committee Members: Iaia, Joseph A., Warchall, Henry Alexander, DeLatte, David.

Subjects/Keywords: Bicentric circles; Polygons; Circle.; Polygons.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Heinlein, D. J. (. J. (1998). Properties of Bicentric Circles for Three-Sided Polygons. (Thesis). University of North Texas. Retrieved from https://digital.library.unt.edu/ark:/67531/metadc278727/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Heinlein, David J (David John). “Properties of Bicentric Circles for Three-Sided Polygons.” 1998. Thesis, University of North Texas. Accessed August 23, 2019. https://digital.library.unt.edu/ark:/67531/metadc278727/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Heinlein, David J (David John). “Properties of Bicentric Circles for Three-Sided Polygons.” 1998. Web. 23 Aug 2019.

Vancouver:

Heinlein DJ(J. Properties of Bicentric Circles for Three-Sided Polygons. [Internet] [Thesis]. University of North Texas; 1998. [cited 2019 Aug 23]. Available from: https://digital.library.unt.edu/ark:/67531/metadc278727/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Heinlein DJ(J. Properties of Bicentric Circles for Three-Sided Polygons. [Thesis]. University of North Texas; 1998. Available from: https://digital.library.unt.edu/ark:/67531/metadc278727/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Akron

2. Auger, Joseph Thomas. Orbits of the Dissected Polygons of the Generalized Catalan Numbers.

Degree: MS, Mathematics, 2011, University of Akron

 Catalan numbers occur regularly throughout many different areas of mathematics. They date back all the way to Euler, and today there are literally hundreds of… (more)

Subjects/Keywords: Mathematics; Catalan; Burnside's Lemma; trees; dissected polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Auger, J. T. (2011). Orbits of the Dissected Polygons of the Generalized Catalan Numbers. (Masters Thesis). University of Akron. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=akron1302701692

Chicago Manual of Style (16th Edition):

Auger, Joseph Thomas. “Orbits of the Dissected Polygons of the Generalized Catalan Numbers.” 2011. Masters Thesis, University of Akron. Accessed August 23, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=akron1302701692.

MLA Handbook (7th Edition):

Auger, Joseph Thomas. “Orbits of the Dissected Polygons of the Generalized Catalan Numbers.” 2011. Web. 23 Aug 2019.

Vancouver:

Auger JT. Orbits of the Dissected Polygons of the Generalized Catalan Numbers. [Internet] [Masters thesis]. University of Akron; 2011. [cited 2019 Aug 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1302701692.

Council of Science Editors:

Auger JT. Orbits of the Dissected Polygons of the Generalized Catalan Numbers. [Masters Thesis]. University of Akron; 2011. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1302701692


Hong Kong University of Science and Technology

3. Wei, Xiangzhi. Monotone path queries and monotone subdivision problems in polygonal domains.

Degree: 2010, Hong Kong University of Science and Technology

 In this thesis, we explore two problems in geometry, both related to monotonicity. The problem of finding monotone paths between two given points has useful… (more)

Subjects/Keywords: Monotone operators; Geometry  – Data processing; Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wei, X. (2010). Monotone path queries and monotone subdivision problems in polygonal domains. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1097620 ; http://repository.ust.hk/ir/bitstream/1783.1-6511/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wei, Xiangzhi. “Monotone path queries and monotone subdivision problems in polygonal domains.” 2010. Thesis, Hong Kong University of Science and Technology. Accessed August 23, 2019. https://doi.org/10.14711/thesis-b1097620 ; http://repository.ust.hk/ir/bitstream/1783.1-6511/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wei, Xiangzhi. “Monotone path queries and monotone subdivision problems in polygonal domains.” 2010. Web. 23 Aug 2019.

Vancouver:

Wei X. Monotone path queries and monotone subdivision problems in polygonal domains. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2010. [cited 2019 Aug 23]. Available from: https://doi.org/10.14711/thesis-b1097620 ; http://repository.ust.hk/ir/bitstream/1783.1-6511/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wei X. Monotone path queries and monotone subdivision problems in polygonal domains. [Thesis]. Hong Kong University of Science and Technology; 2010. Available from: https://doi.org/10.14711/thesis-b1097620 ; http://repository.ust.hk/ir/bitstream/1783.1-6511/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Hong Kong University of Science and Technology

4. Chen, Zhanqing. Geodesic iso-contours, bisectors and voronoi diagrams on triangulated meshes and their applications.

Degree: 2011, Hong Kong University of Science and Technology

 Voronoi diagram is an elegant spatial structure which has found diverse applications in a variety of disciplines in natural science and engineering, including pattern recognition,… (more)

Subjects/Keywords: Voronoi polygons; Geodesics (Mathematics); Triangulated categories

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, Z. (2011). Geodesic iso-contours, bisectors and voronoi diagrams on triangulated meshes and their applications. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1139186 ; http://repository.ust.hk/ir/bitstream/1783.1-7133/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chen, Zhanqing. “Geodesic iso-contours, bisectors and voronoi diagrams on triangulated meshes and their applications.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed August 23, 2019. https://doi.org/10.14711/thesis-b1139186 ; http://repository.ust.hk/ir/bitstream/1783.1-7133/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chen, Zhanqing. “Geodesic iso-contours, bisectors and voronoi diagrams on triangulated meshes and their applications.” 2011. Web. 23 Aug 2019.

Vancouver:

Chen Z. Geodesic iso-contours, bisectors and voronoi diagrams on triangulated meshes and their applications. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2019 Aug 23]. Available from: https://doi.org/10.14711/thesis-b1139186 ; http://repository.ust.hk/ir/bitstream/1783.1-7133/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chen Z. Geodesic iso-contours, bisectors and voronoi diagrams on triangulated meshes and their applications. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: https://doi.org/10.14711/thesis-b1139186 ; http://repository.ust.hk/ir/bitstream/1783.1-7133/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Hong Kong University of Science and Technology

5. Lam, Chi-kit. Shape matching under rigid motion.

Degree: 2012, Hong Kong University of Science and Technology

 We present improved algorithms to efficiently match two polygonal shapes. Let n be their total number of vertices. Our first algorithm finds a translation vector… (more)

Subjects/Keywords: Computer vision; Optical pattern recognition; Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lam, C. (2012). Shape matching under rigid motion. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1198608 ; http://repository.ust.hk/ir/bitstream/1783.1-7764/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lam, Chi-kit. “Shape matching under rigid motion.” 2012. Thesis, Hong Kong University of Science and Technology. Accessed August 23, 2019. https://doi.org/10.14711/thesis-b1198608 ; http://repository.ust.hk/ir/bitstream/1783.1-7764/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lam, Chi-kit. “Shape matching under rigid motion.” 2012. Web. 23 Aug 2019.

Vancouver:

Lam C. Shape matching under rigid motion. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2019 Aug 23]. Available from: https://doi.org/10.14711/thesis-b1198608 ; http://repository.ust.hk/ir/bitstream/1783.1-7764/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lam C. Shape matching under rigid motion. [Thesis]. Hong Kong University of Science and Technology; 2012. Available from: https://doi.org/10.14711/thesis-b1198608 ; http://repository.ust.hk/ir/bitstream/1783.1-7764/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


McGill University

6. El-Gindy, Hossam Ahmed. Visibility in polygons with applications.

Degree: MS, School of Computer Science, 1980, McGill University

Subjects/Keywords: Polygons.; Computer graphics.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

El-Gindy, H. A. (1980). Visibility in polygons with applications. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile52537.pdf

Chicago Manual of Style (16th Edition):

El-Gindy, Hossam Ahmed. “Visibility in polygons with applications.” 1980. Masters Thesis, McGill University. Accessed August 23, 2019. http://digitool.library.mcgill.ca/thesisfile52537.pdf.

MLA Handbook (7th Edition):

El-Gindy, Hossam Ahmed. “Visibility in polygons with applications.” 1980. Web. 23 Aug 2019.

Vancouver:

El-Gindy HA. Visibility in polygons with applications. [Internet] [Masters thesis]. McGill University; 1980. [cited 2019 Aug 23]. Available from: http://digitool.library.mcgill.ca/thesisfile52537.pdf.

Council of Science Editors:

El-Gindy HA. Visibility in polygons with applications. [Masters Thesis]. McGill University; 1980. Available from: http://digitool.library.mcgill.ca/thesisfile52537.pdf


Oregon State University

7. Trubin, Stanislav I. Information space mapping with adaptive multiplicatively weighted Voronoi diagrams.

Degree: MS, Computer Science, 2006, Oregon State University

 Traditional application of Voronoi diagrams for space partitioning creates Voronoi regions, with areas determined by the generators’ relative locations and weights. Especially in the area… (more)

Subjects/Keywords: voronoi; Voronoi polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Trubin, S. I. (2006). Information space mapping with adaptive multiplicatively weighted Voronoi diagrams. (Masters Thesis). Oregon State University. Retrieved from http://hdl.handle.net/1957/2824

Chicago Manual of Style (16th Edition):

Trubin, Stanislav I. “Information space mapping with adaptive multiplicatively weighted Voronoi diagrams.” 2006. Masters Thesis, Oregon State University. Accessed August 23, 2019. http://hdl.handle.net/1957/2824.

MLA Handbook (7th Edition):

Trubin, Stanislav I. “Information space mapping with adaptive multiplicatively weighted Voronoi diagrams.” 2006. Web. 23 Aug 2019.

Vancouver:

Trubin SI. Information space mapping with adaptive multiplicatively weighted Voronoi diagrams. [Internet] [Masters thesis]. Oregon State University; 2006. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/1957/2824.

Council of Science Editors:

Trubin SI. Information space mapping with adaptive multiplicatively weighted Voronoi diagrams. [Masters Thesis]. Oregon State University; 2006. Available from: http://hdl.handle.net/1957/2824


Virginia Tech

8. Lanz, Colleen B. The Use of Schwarz-Christoffel Transformations in Determining Acoustic Resonances.

Degree: MS, Mathematics, 2010, Virginia Tech

 In this thesis, we set out to provide an enhanced set of techniques for determining the eigenvalues of the Laplacian in polygonal domains. Currently, finite-element… (more)

Subjects/Keywords: Laplacian; Eigenvalues; Schwarz-Christoffel Transformations; Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lanz, C. B. (2010). The Use of Schwarz-Christoffel Transformations in Determining Acoustic Resonances. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/33933

Chicago Manual of Style (16th Edition):

Lanz, Colleen B. “The Use of Schwarz-Christoffel Transformations in Determining Acoustic Resonances.” 2010. Masters Thesis, Virginia Tech. Accessed August 23, 2019. http://hdl.handle.net/10919/33933.

MLA Handbook (7th Edition):

Lanz, Colleen B. “The Use of Schwarz-Christoffel Transformations in Determining Acoustic Resonances.” 2010. Web. 23 Aug 2019.

Vancouver:

Lanz CB. The Use of Schwarz-Christoffel Transformations in Determining Acoustic Resonances. [Internet] [Masters thesis]. Virginia Tech; 2010. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/10919/33933.

Council of Science Editors:

Lanz CB. The Use of Schwarz-Christoffel Transformations in Determining Acoustic Resonances. [Masters Thesis]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/33933


University of British Columbia

9. Stoch, Stephen Leonard. Interactive polygon filling on a raster graphic display .

Degree: 1981, University of British Columbia

 This thesis describes Polygon Filling System, an interactive graphics system, which fills user defined areas on a raster scan graphics display device. The areas may… (more)

Subjects/Keywords: Computer graphics; Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Stoch, S. L. (1981). Interactive polygon filling on a raster graphic display . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/22650

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Stoch, Stephen Leonard. “Interactive polygon filling on a raster graphic display .” 1981. Thesis, University of British Columbia. Accessed August 23, 2019. http://hdl.handle.net/2429/22650.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Stoch, Stephen Leonard. “Interactive polygon filling on a raster graphic display .” 1981. Web. 23 Aug 2019.

Vancouver:

Stoch SL. Interactive polygon filling on a raster graphic display . [Internet] [Thesis]. University of British Columbia; 1981. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/2429/22650.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Stoch SL. Interactive polygon filling on a raster graphic display . [Thesis]. University of British Columbia; 1981. Available from: http://hdl.handle.net/2429/22650

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Western Kentucky University

10. Veeramachaneni, Sai Sindhuja. Generating Random Walks and Polygons with Thickness in Confinement.

Degree: MS, Department of Computer Science, 2015, Western Kentucky University

  Algorithms to generate walks (chains of unit-length, freely-jointed segments) and polygons (closed walks) in spherical confinements have been developed in the last few years.… (more)

Subjects/Keywords: random polygons; confinement; algorithm; Computer Sciences; Physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Veeramachaneni, S. S. (2015). Generating Random Walks and Polygons with Thickness in Confinement. (Masters Thesis). Western Kentucky University. Retrieved from https://digitalcommons.wku.edu/theses/1482

Chicago Manual of Style (16th Edition):

Veeramachaneni, Sai Sindhuja. “Generating Random Walks and Polygons with Thickness in Confinement.” 2015. Masters Thesis, Western Kentucky University. Accessed August 23, 2019. https://digitalcommons.wku.edu/theses/1482.

MLA Handbook (7th Edition):

Veeramachaneni, Sai Sindhuja. “Generating Random Walks and Polygons with Thickness in Confinement.” 2015. Web. 23 Aug 2019.

Vancouver:

Veeramachaneni SS. Generating Random Walks and Polygons with Thickness in Confinement. [Internet] [Masters thesis]. Western Kentucky University; 2015. [cited 2019 Aug 23]. Available from: https://digitalcommons.wku.edu/theses/1482.

Council of Science Editors:

Veeramachaneni SS. Generating Random Walks and Polygons with Thickness in Confinement. [Masters Thesis]. Western Kentucky University; 2015. Available from: https://digitalcommons.wku.edu/theses/1482


McGill University

11. Gum, Teren. A simple linear algorithm for computing edge-to-edge visibility in a polygon.

Degree: MS, School of Computer Science., 1986, McGill University

Subjects/Keywords: Image processing.; Polygons.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gum, T. (1986). A simple linear algorithm for computing edge-to-edge visibility in a polygon. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile65508.pdf

Chicago Manual of Style (16th Edition):

Gum, Teren. “A simple linear algorithm for computing edge-to-edge visibility in a polygon.” 1986. Masters Thesis, McGill University. Accessed August 23, 2019. http://digitool.library.mcgill.ca/thesisfile65508.pdf.

MLA Handbook (7th Edition):

Gum, Teren. “A simple linear algorithm for computing edge-to-edge visibility in a polygon.” 1986. Web. 23 Aug 2019.

Vancouver:

Gum T. A simple linear algorithm for computing edge-to-edge visibility in a polygon. [Internet] [Masters thesis]. McGill University; 1986. [cited 2019 Aug 23]. Available from: http://digitool.library.mcgill.ca/thesisfile65508.pdf.

Council of Science Editors:

Gum T. A simple linear algorithm for computing edge-to-edge visibility in a polygon. [Masters Thesis]. McGill University; 1986. Available from: http://digitool.library.mcgill.ca/thesisfile65508.pdf


Hong Kong University of Science and Technology

12. Chan, Yiu Wai CSE. Approximate Voronoi cells over data streams.

Degree: 2013, Hong Kong University of Science and Technology

 Given a positive real parameter ε, we consider the problem of maintaining an ε-approximate Voronoi cell of a fixed point p with respect to a… (more)

Subjects/Keywords: Voronoi polygons; Computer science; Mathematics; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chan, Y. W. C. (2013). Approximate Voronoi cells over data streams. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1255220 ; http://repository.ust.hk/ir/bitstream/1783.1-92606/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chan, Yiu Wai CSE. “Approximate Voronoi cells over data streams.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed August 23, 2019. https://doi.org/10.14711/thesis-b1255220 ; http://repository.ust.hk/ir/bitstream/1783.1-92606/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chan, Yiu Wai CSE. “Approximate Voronoi cells over data streams.” 2013. Web. 23 Aug 2019.

Vancouver:

Chan YWC. Approximate Voronoi cells over data streams. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2019 Aug 23]. Available from: https://doi.org/10.14711/thesis-b1255220 ; http://repository.ust.hk/ir/bitstream/1783.1-92606/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chan YWC. Approximate Voronoi cells over data streams. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: https://doi.org/10.14711/thesis-b1255220 ; http://repository.ust.hk/ir/bitstream/1783.1-92606/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade Federal de Viçosa

13. Frederico Ventura Batista. Ladrilhamentos irregulares, discos extremos e grafos de balão.

Degree: 2012, Universidade Federal de Viçosa

Esta dissertação tem como objetivo o estudo de dois temas ligados a topologia e a geometria moderna. O primeiro destes temas é dedicado ao estudo… (more)

Subjects/Keywords: TOPOLOGIA ALGEBRICA; Plano hiperbólico; Polígonos irregulares; Polígonos regulares; Hyperbolic plane; Irregular polygons; Regular polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Batista, F. V. (2012). Ladrilhamentos irregulares, discos extremos e grafos de balão. (Thesis). Universidade Federal de Viçosa. Retrieved from http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Batista, Frederico Ventura. “Ladrilhamentos irregulares, discos extremos e grafos de balão.” 2012. Thesis, Universidade Federal de Viçosa. Accessed August 23, 2019. http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Batista, Frederico Ventura. “Ladrilhamentos irregulares, discos extremos e grafos de balão.” 2012. Web. 23 Aug 2019.

Vancouver:

Batista FV. Ladrilhamentos irregulares, discos extremos e grafos de balão. [Internet] [Thesis]. Universidade Federal de Viçosa; 2012. [cited 2019 Aug 23]. Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Batista FV. Ladrilhamentos irregulares, discos extremos e grafos de balão. [Thesis]. Universidade Federal de Viçosa; 2012. Available from: http://www.tede.ufv.br/tedesimplificado/tde_busca/arquivo.php?codArquivo=4017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Indian Institute of Science

14. Rao, Balaji R. A Formal Proof of Feit-Higman Theorem in Agda.

Degree: 2014, Indian Institute of Science

 In this thesis we present a formalization of the combinatorial part of the proof of Feit-Higman theorem on generalized polygons. Generalised polygons are abstract geometric… (more)

Subjects/Keywords: Feit-Higman Theorem; Agda (Computer Program Langauge); Polygons; Generalised Polygons; Type Theory; Lemma; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rao, B. R. (2014). A Formal Proof of Feit-Higman Theorem in Agda. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/3128

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rao, Balaji R. “A Formal Proof of Feit-Higman Theorem in Agda.” 2014. Thesis, Indian Institute of Science. Accessed August 23, 2019. http://hdl.handle.net/2005/3128.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rao, Balaji R. “A Formal Proof of Feit-Higman Theorem in Agda.” 2014. Web. 23 Aug 2019.

Vancouver:

Rao BR. A Formal Proof of Feit-Higman Theorem in Agda. [Internet] [Thesis]. Indian Institute of Science; 2014. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/2005/3128.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rao BR. A Formal Proof of Feit-Higman Theorem in Agda. [Thesis]. Indian Institute of Science; 2014. Available from: http://hdl.handle.net/2005/3128

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Saskatchewan

15. Eng, Jeremy. Self-avoiding polygons in (L, M)-tubes.

Degree: 2014, University of Saskatchewan

 By studying self-avoiding polygons (SAPs) in (L, M )-tubes (a tubular sublattice of the simple cubic lattice) as a sequence of 2-spans, transfer matrices can… (more)

Subjects/Keywords: self-avoiding polygon; simple cubic lattice; pattern theorem; transfer matrix; knots; polygon generation; compact polygons; stretched polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Eng, J. (2014). Self-avoiding polygons in (L, M)-tubes. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/ETD-2014-09-1701

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Eng, Jeremy. “Self-avoiding polygons in (L, M)-tubes.” 2014. Thesis, University of Saskatchewan. Accessed August 23, 2019. http://hdl.handle.net/10388/ETD-2014-09-1701.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Eng, Jeremy. “Self-avoiding polygons in (L, M)-tubes.” 2014. Web. 23 Aug 2019.

Vancouver:

Eng J. Self-avoiding polygons in (L, M)-tubes. [Internet] [Thesis]. University of Saskatchewan; 2014. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/10388/ETD-2014-09-1701.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Eng J. Self-avoiding polygons in (L, M)-tubes. [Thesis]. University of Saskatchewan; 2014. Available from: http://hdl.handle.net/10388/ETD-2014-09-1701

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


The Ohio State University

16. Lichtin, Benjamin Lloyd. I. Newton polygons and computation of Lojasiewicz exponents ; II. On the differential equations associated to an analytic function near a singular point.

Degree: PhD, Graduate School, 1978, The Ohio State University

Subjects/Keywords: Mathematics; Differential equations; Geometry; Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lichtin, B. L. (1978). I. Newton polygons and computation of Lojasiewicz exponents ; II. On the differential equations associated to an analytic function near a singular point. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1487081370607809

Chicago Manual of Style (16th Edition):

Lichtin, Benjamin Lloyd. “I. Newton polygons and computation of Lojasiewicz exponents ; II. On the differential equations associated to an analytic function near a singular point.” 1978. Doctoral Dissertation, The Ohio State University. Accessed August 23, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487081370607809.

MLA Handbook (7th Edition):

Lichtin, Benjamin Lloyd. “I. Newton polygons and computation of Lojasiewicz exponents ; II. On the differential equations associated to an analytic function near a singular point.” 1978. Web. 23 Aug 2019.

Vancouver:

Lichtin BL. I. Newton polygons and computation of Lojasiewicz exponents ; II. On the differential equations associated to an analytic function near a singular point. [Internet] [Doctoral dissertation]. The Ohio State University; 1978. [cited 2019 Aug 23]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487081370607809.

Council of Science Editors:

Lichtin BL. I. Newton polygons and computation of Lojasiewicz exponents ; II. On the differential equations associated to an analytic function near a singular point. [Doctoral Dissertation]. The Ohio State University; 1978. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1487081370607809

17. Ρέτζεκα, Μαρία. Η διδασκαλία της Γεωμετρίας -ιδιαίτερα της συμμετρίας των πολυγώνων- στο δημοτικό και το γυμνάσιο.

Degree: 2014, University of Patras

Η παρούσα εργασία μελετά τη διδασκαλία της Γεωμετρίας στα σχολεία και τον τρόπο που παρουσιάζεται στα σχολικά εγχειρίδια του Δημοτικού και του Γυμνασίου σε σχέση… (more)

Subjects/Keywords: Συμμετρία; Πολύγωνα; Μαιευτική μέθοδος; 372.760 44; Symmetry; Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ρέτζεκα, . (2014). Η διδασκαλία της Γεωμετρίας -ιδιαίτερα της συμμετρίας των πολυγώνων- στο δημοτικό και το γυμνάσιο. (Masters Thesis). University of Patras. Retrieved from http://hdl.handle.net/10889/8377

Chicago Manual of Style (16th Edition):

Ρέτζεκα, Μαρία. “Η διδασκαλία της Γεωμετρίας -ιδιαίτερα της συμμετρίας των πολυγώνων- στο δημοτικό και το γυμνάσιο.” 2014. Masters Thesis, University of Patras. Accessed August 23, 2019. http://hdl.handle.net/10889/8377.

MLA Handbook (7th Edition):

Ρέτζεκα, Μαρία. “Η διδασκαλία της Γεωμετρίας -ιδιαίτερα της συμμετρίας των πολυγώνων- στο δημοτικό και το γυμνάσιο.” 2014. Web. 23 Aug 2019.

Vancouver:

Ρέτζεκα . Η διδασκαλία της Γεωμετρίας -ιδιαίτερα της συμμετρίας των πολυγώνων- στο δημοτικό και το γυμνάσιο. [Internet] [Masters thesis]. University of Patras; 2014. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/10889/8377.

Council of Science Editors:

Ρέτζεκα . Η διδασκαλία της Γεωμετρίας -ιδιαίτερα της συμμετρίας των πολυγώνων- στο δημοτικό και το γυμνάσιο. [Masters Thesis]. University of Patras; 2014. Available from: http://hdl.handle.net/10889/8377


Hong Kong University of Science and Technology

18. Wei, Xiangzhi. Some algorithms for computing monotone paths with engineering applications.

Degree: 2013, Hong Kong University of Science and Technology

 In this thesis, we explore three problems related to monotonicity. Polygon partitioning is an important problem in computational geometry with a long history. In my… (more)

Subjects/Keywords: Monotonic functions; Geometry; Data processing; Convex functions; Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wei, X. (2013). Some algorithms for computing monotone paths with engineering applications. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1214692 ; http://repository.ust.hk/ir/bitstream/1783.1-7892/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wei, Xiangzhi. “Some algorithms for computing monotone paths with engineering applications.” 2013. Thesis, Hong Kong University of Science and Technology. Accessed August 23, 2019. https://doi.org/10.14711/thesis-b1214692 ; http://repository.ust.hk/ir/bitstream/1783.1-7892/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wei, Xiangzhi. “Some algorithms for computing monotone paths with engineering applications.” 2013. Web. 23 Aug 2019.

Vancouver:

Wei X. Some algorithms for computing monotone paths with engineering applications. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2019 Aug 23]. Available from: https://doi.org/10.14711/thesis-b1214692 ; http://repository.ust.hk/ir/bitstream/1783.1-7892/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wei X. Some algorithms for computing monotone paths with engineering applications. [Thesis]. Hong Kong University of Science and Technology; 2013. Available from: https://doi.org/10.14711/thesis-b1214692 ; http://repository.ust.hk/ir/bitstream/1783.1-7892/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Hong Kong University of Science and Technology

19. Wong, Tak-Wing. Centroidal voronoi tessellation : theorys, applications and numerical results.

Degree: 1999, Hong Kong University of Science and Technology

 Voronoi tessellation was known a long time ago. A centroidal Voronoi tessellation (CVT) is a special type of Voronoi tessellation that the Voronoi points (generators)… (more)

Subjects/Keywords: Tessellation (Mathematics); Voronoi polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wong, T. (1999). Centroidal voronoi tessellation : theorys, applications and numerical results. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b645949 ; http://repository.ust.hk/ir/bitstream/1783.1-5087/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wong, Tak-Wing. “Centroidal voronoi tessellation : theorys, applications and numerical results.” 1999. Thesis, Hong Kong University of Science and Technology. Accessed August 23, 2019. https://doi.org/10.14711/thesis-b645949 ; http://repository.ust.hk/ir/bitstream/1783.1-5087/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wong, Tak-Wing. “Centroidal voronoi tessellation : theorys, applications and numerical results.” 1999. Web. 23 Aug 2019.

Vancouver:

Wong T. Centroidal voronoi tessellation : theorys, applications and numerical results. [Internet] [Thesis]. Hong Kong University of Science and Technology; 1999. [cited 2019 Aug 23]. Available from: https://doi.org/10.14711/thesis-b645949 ; http://repository.ust.hk/ir/bitstream/1783.1-5087/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wong T. Centroidal voronoi tessellation : theorys, applications and numerical results. [Thesis]. Hong Kong University of Science and Technology; 1999. Available from: https://doi.org/10.14711/thesis-b645949 ; http://repository.ust.hk/ir/bitstream/1783.1-5087/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Hong Kong University of Science and Technology

20. Cheong, Jae-Sook. Strip decomposition of polygons.

Degree: 2000, Hong Kong University of Science and Technology

 In computer graphics, most polygonal surfaces are rendered as a collection of triangles. Rendering a triangle requires the coordinates of its three vertices. Since the… (more)

Subjects/Keywords: Computer algorithms; Computer graphics; Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cheong, J. (2000). Strip decomposition of polygons. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b673099 ; http://repository.ust.hk/ir/bitstream/1783.1-5691/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Cheong, Jae-Sook. “Strip decomposition of polygons.” 2000. Thesis, Hong Kong University of Science and Technology. Accessed August 23, 2019. https://doi.org/10.14711/thesis-b673099 ; http://repository.ust.hk/ir/bitstream/1783.1-5691/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cheong, Jae-Sook. “Strip decomposition of polygons.” 2000. Web. 23 Aug 2019.

Vancouver:

Cheong J. Strip decomposition of polygons. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2000. [cited 2019 Aug 23]. Available from: https://doi.org/10.14711/thesis-b673099 ; http://repository.ust.hk/ir/bitstream/1783.1-5691/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cheong J. Strip decomposition of polygons. [Thesis]. Hong Kong University of Science and Technology; 2000. Available from: https://doi.org/10.14711/thesis-b673099 ; http://repository.ust.hk/ir/bitstream/1783.1-5691/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Hong Kong

21. 张培武.; Zhang, Peiwu. Voronoi-based nearest neighbor search for multi-dimensional uncertain databases.

Degree: M. Phil., 2012, University of Hong Kong

In Voronoi-based nearest neighbor search, the Voronoi cell of every point p in a database can be used to check whether p is the closest… (more)

Subjects/Keywords: Voronoi polygons.; Nearest neighbor analysis (Statistics); Uncertainty (Information theory)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

张培武.; Zhang, P. (2012). Voronoi-based nearest neighbor search for multi-dimensional uncertain databases. (Masters Thesis). University of Hong Kong. Retrieved from Zhang, P. [张培武]. (2012). Voronoi-based nearest neighbor search for multi-dimensional uncertain databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4961817 ; http://dx.doi.org/10.5353/th_b4961817 ; http://hdl.handle.net/10722/181489

Chicago Manual of Style (16th Edition):

张培武.; Zhang, Peiwu. “Voronoi-based nearest neighbor search for multi-dimensional uncertain databases.” 2012. Masters Thesis, University of Hong Kong. Accessed August 23, 2019. Zhang, P. [张培武]. (2012). Voronoi-based nearest neighbor search for multi-dimensional uncertain databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4961817 ; http://dx.doi.org/10.5353/th_b4961817 ; http://hdl.handle.net/10722/181489.

MLA Handbook (7th Edition):

张培武.; Zhang, Peiwu. “Voronoi-based nearest neighbor search for multi-dimensional uncertain databases.” 2012. Web. 23 Aug 2019.

Vancouver:

张培武.; Zhang P. Voronoi-based nearest neighbor search for multi-dimensional uncertain databases. [Internet] [Masters thesis]. University of Hong Kong; 2012. [cited 2019 Aug 23]. Available from: Zhang, P. [张培武]. (2012). Voronoi-based nearest neighbor search for multi-dimensional uncertain databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4961817 ; http://dx.doi.org/10.5353/th_b4961817 ; http://hdl.handle.net/10722/181489.

Council of Science Editors:

张培武.; Zhang P. Voronoi-based nearest neighbor search for multi-dimensional uncertain databases. [Masters Thesis]. University of Hong Kong; 2012. Available from: Zhang, P. [张培武]. (2012). Voronoi-based nearest neighbor search for multi-dimensional uncertain databases. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4961817 ; http://dx.doi.org/10.5353/th_b4961817 ; http://hdl.handle.net/10722/181489


University of Victoria

22. Ahmadi, Maryam. Modeling and analysis of wireless cognitive radio networks: a geometrical probability approach.

Degree: Department of Computer Science, 2016, University of Victoria

 Wireless devices and applications have been an unavoidable part of human lives in the past decade. In the past few years, the global mobile data… (more)

Subjects/Keywords: Cognitive Radio Networks; Geometrical Probability; Interference Analysis; Irregular Polygons; Heterogeneous Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ahmadi, M. (2016). Modeling and analysis of wireless cognitive radio networks: a geometrical probability approach. (Thesis). University of Victoria. Retrieved from http://hdl.handle.net/1828/7055

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ahmadi, Maryam. “Modeling and analysis of wireless cognitive radio networks: a geometrical probability approach.” 2016. Thesis, University of Victoria. Accessed August 23, 2019. http://hdl.handle.net/1828/7055.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ahmadi, Maryam. “Modeling and analysis of wireless cognitive radio networks: a geometrical probability approach.” 2016. Web. 23 Aug 2019.

Vancouver:

Ahmadi M. Modeling and analysis of wireless cognitive radio networks: a geometrical probability approach. [Internet] [Thesis]. University of Victoria; 2016. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/1828/7055.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahmadi M. Modeling and analysis of wireless cognitive radio networks: a geometrical probability approach. [Thesis]. University of Victoria; 2016. Available from: http://hdl.handle.net/1828/7055

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


McGill University

23. Sack, Jörg-Rüdiger. Rectilinear computational geometry.

Degree: PhD, School of Computer Science., 1984, McGill University

In this thesis it is demonstrated that the structure of rectilinear polygons can be exploited to solve a variety of geometric problems efficiently. These problems… (more)

Subjects/Keywords: Geometry  – Data processing.; Polygons.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sack, J. (1984). Rectilinear computational geometry. (Doctoral Dissertation). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile71872.pdf

Chicago Manual of Style (16th Edition):

Sack, Jörg-Rüdiger. “Rectilinear computational geometry.” 1984. Doctoral Dissertation, McGill University. Accessed August 23, 2019. http://digitool.library.mcgill.ca/thesisfile71872.pdf.

MLA Handbook (7th Edition):

Sack, Jörg-Rüdiger. “Rectilinear computational geometry.” 1984. Web. 23 Aug 2019.

Vancouver:

Sack J. Rectilinear computational geometry. [Internet] [Doctoral dissertation]. McGill University; 1984. [cited 2019 Aug 23]. Available from: http://digitool.library.mcgill.ca/thesisfile71872.pdf.

Council of Science Editors:

Sack J. Rectilinear computational geometry. [Doctoral Dissertation]. McGill University; 1984. Available from: http://digitool.library.mcgill.ca/thesisfile71872.pdf


Queen Mary, University of London

24. Haug, Nils Adrian. Asymptotics and scaling analysis of 2-dimensional lattice models of vesicles and polymers.

Degree: PhD, 2017, Queen Mary, University of London

 The subject of this thesis is the asymptotic behaviour of generating functions of different combinatorial models of two-dimensional lattice walks and polygons, enumerated with respect… (more)

Subjects/Keywords: Mathematical Sciences; combinatorial models; two-dimensional lattice walks; polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Haug, N. A. (2017). Asymptotics and scaling analysis of 2-dimensional lattice models of vesicles and polymers. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/30706 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766023

Chicago Manual of Style (16th Edition):

Haug, Nils Adrian. “Asymptotics and scaling analysis of 2-dimensional lattice models of vesicles and polymers.” 2017. Doctoral Dissertation, Queen Mary, University of London. Accessed August 23, 2019. http://qmro.qmul.ac.uk/xmlui/handle/123456789/30706 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766023.

MLA Handbook (7th Edition):

Haug, Nils Adrian. “Asymptotics and scaling analysis of 2-dimensional lattice models of vesicles and polymers.” 2017. Web. 23 Aug 2019.

Vancouver:

Haug NA. Asymptotics and scaling analysis of 2-dimensional lattice models of vesicles and polymers. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2017. [cited 2019 Aug 23]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/30706 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766023.

Council of Science Editors:

Haug NA. Asymptotics and scaling analysis of 2-dimensional lattice models of vesicles and polymers. [Doctoral Dissertation]. Queen Mary, University of London; 2017. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/30706 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766023


University of British Columbia

25. Kreykenbohm, Michael Walter. Replication patterns for polygon fill algorithms .

Degree: 1988, University of British Columbia

 This thesis describes and compares several methods for producing bilevel patterns to simulate grey level values for use in polygon regions as generated for computer… (more)

Subjects/Keywords: Polygons; Computer graphics; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kreykenbohm, M. W. (1988). Replication patterns for polygon fill algorithms . (Thesis). University of British Columbia. Retrieved from http://hdl.handle.net/2429/27974

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kreykenbohm, Michael Walter. “Replication patterns for polygon fill algorithms .” 1988. Thesis, University of British Columbia. Accessed August 23, 2019. http://hdl.handle.net/2429/27974.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kreykenbohm, Michael Walter. “Replication patterns for polygon fill algorithms .” 1988. Web. 23 Aug 2019.

Vancouver:

Kreykenbohm MW. Replication patterns for polygon fill algorithms . [Internet] [Thesis]. University of British Columbia; 1988. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/2429/27974.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kreykenbohm MW. Replication patterns for polygon fill algorithms . [Thesis]. University of British Columbia; 1988. Available from: http://hdl.handle.net/2429/27974

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Lethbridge

26. University of Lethbridge. Faculty of Arts and Science. Polygon reconstruction from visibility information .

Degree: 1996, University of Lethbridge

 Reconstruction results attempt to rebuild polygons from visibility information. Reconstruction of a general polygon from its visibility graph is still open and only known to… (more)

Subjects/Keywords: Polygons; Graph theory; Dissertations, Academic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Science, U. o. L. F. o. A. a. (1996). Polygon reconstruction from visibility information . (Thesis). University of Lethbridge. Retrieved from http://hdl.handle.net/10133/41

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Science, University of Lethbridge. Faculty of Arts and. “Polygon reconstruction from visibility information .” 1996. Thesis, University of Lethbridge. Accessed August 23, 2019. http://hdl.handle.net/10133/41.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Science, University of Lethbridge. Faculty of Arts and. “Polygon reconstruction from visibility information .” 1996. Web. 23 Aug 2019.

Vancouver:

Science UoLFoAa. Polygon reconstruction from visibility information . [Internet] [Thesis]. University of Lethbridge; 1996. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/10133/41.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Science UoLFoAa. Polygon reconstruction from visibility information . [Thesis]. University of Lethbridge; 1996. Available from: http://hdl.handle.net/10133/41

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. Ledoux, Hugo. Modelling three-dimensional fields in geoscience with the Voronoi diagram and its dual.

Degree: PhD, 2006, University of South Wales

 The objects studied in geoscience are often not man-made objects, but rather the spatial distribution of three-dimensional continuous geographical phenomena such as the salinity of… (more)

Subjects/Keywords: 551.0113; Voronoi polygons; geology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ledoux, H. (2006). Modelling three-dimensional fields in geoscience with the Voronoi diagram and its dual. (Doctoral Dissertation). University of South Wales. Retrieved from https://pure.southwales.ac.uk/en/studentthesis/modelling-threedimensional-fields-in-geoscience-with-the-voronoi-diagram-and-its-dual(0cbb5565-4493-4f07-bd6a-3e41c47c056e).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435474

Chicago Manual of Style (16th Edition):

Ledoux, Hugo. “Modelling three-dimensional fields in geoscience with the Voronoi diagram and its dual.” 2006. Doctoral Dissertation, University of South Wales. Accessed August 23, 2019. https://pure.southwales.ac.uk/en/studentthesis/modelling-threedimensional-fields-in-geoscience-with-the-voronoi-diagram-and-its-dual(0cbb5565-4493-4f07-bd6a-3e41c47c056e).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435474.

MLA Handbook (7th Edition):

Ledoux, Hugo. “Modelling three-dimensional fields in geoscience with the Voronoi diagram and its dual.” 2006. Web. 23 Aug 2019.

Vancouver:

Ledoux H. Modelling three-dimensional fields in geoscience with the Voronoi diagram and its dual. [Internet] [Doctoral dissertation]. University of South Wales; 2006. [cited 2019 Aug 23]. Available from: https://pure.southwales.ac.uk/en/studentthesis/modelling-threedimensional-fields-in-geoscience-with-the-voronoi-diagram-and-its-dual(0cbb5565-4493-4f07-bd6a-3e41c47c056e).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435474.

Council of Science Editors:

Ledoux H. Modelling three-dimensional fields in geoscience with the Voronoi diagram and its dual. [Doctoral Dissertation]. University of South Wales; 2006. Available from: https://pure.southwales.ac.uk/en/studentthesis/modelling-threedimensional-fields-in-geoscience-with-the-voronoi-diagram-and-its-dual(0cbb5565-4493-4f07-bd6a-3e41c47c056e).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435474


George Mason University

28. Khan, Tunaggina Subrina. Evaluating the Errors Associated with Zip Code Polygon When Employed for Spatial Analyses .

Degree: 2013, George Mason University

 ZIP Codes have traditionally been represented cartographically as polygon features. Polygon-based representations of ZIP Codes are derived from point features employing interpolation techniques. There has… (more)

Subjects/Keywords: zip code polygons; spatial analysis; errors; statistical comparison; uncertainty

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Khan, T. S. (2013). Evaluating the Errors Associated with Zip Code Polygon When Employed for Spatial Analyses . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/8023

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Khan, Tunaggina Subrina. “Evaluating the Errors Associated with Zip Code Polygon When Employed for Spatial Analyses .” 2013. Thesis, George Mason University. Accessed August 23, 2019. http://hdl.handle.net/1920/8023.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Khan, Tunaggina Subrina. “Evaluating the Errors Associated with Zip Code Polygon When Employed for Spatial Analyses .” 2013. Web. 23 Aug 2019.

Vancouver:

Khan TS. Evaluating the Errors Associated with Zip Code Polygon When Employed for Spatial Analyses . [Internet] [Thesis]. George Mason University; 2013. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/1920/8023.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Khan TS. Evaluating the Errors Associated with Zip Code Polygon When Employed for Spatial Analyses . [Thesis]. George Mason University; 2013. Available from: http://hdl.handle.net/1920/8023

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Simon Fraser University

29. Kaller, Damon M. Output sensitive algorithms to compute higher-order Voroni diagrams in Euclidean D-space.

Degree: 1992, Simon Fraser University

Subjects/Keywords: Voroni polygons.; Graph theory.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kaller, D. M. (1992). Output sensitive algorithms to compute higher-order Voroni diagrams in Euclidean D-space. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/3720

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kaller, Damon M. “Output sensitive algorithms to compute higher-order Voroni diagrams in Euclidean D-space.” 1992. Thesis, Simon Fraser University. Accessed August 23, 2019. http://summit.sfu.ca/item/3720.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kaller, Damon M. “Output sensitive algorithms to compute higher-order Voroni diagrams in Euclidean D-space.” 1992. Web. 23 Aug 2019.

Vancouver:

Kaller DM. Output sensitive algorithms to compute higher-order Voroni diagrams in Euclidean D-space. [Internet] [Thesis]. Simon Fraser University; 1992. [cited 2019 Aug 23]. Available from: http://summit.sfu.ca/item/3720.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kaller DM. Output sensitive algorithms to compute higher-order Voroni diagrams in Euclidean D-space. [Thesis]. Simon Fraser University; 1992. Available from: http://summit.sfu.ca/item/3720

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Northeastern University

30. Scheidwasser, Ilya. Contractions of polygons in abstract polytopes.

Degree: PhD, Department of Mathematics, 2015, Northeastern University

 There are several well-known constructions of new polytopes from old, such as the pyramid and prism constructions. This thesis defines two new local constructions on… (more)

Subjects/Keywords: abstract polytopes; combinatorics; Polytopes; Polygons; Combinatorial analysis; Discrete geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Scheidwasser, I. (2015). Contractions of polygons in abstract polytopes. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20194153

Chicago Manual of Style (16th Edition):

Scheidwasser, Ilya. “Contractions of polygons in abstract polytopes.” 2015. Doctoral Dissertation, Northeastern University. Accessed August 23, 2019. http://hdl.handle.net/2047/D20194153.

MLA Handbook (7th Edition):

Scheidwasser, Ilya. “Contractions of polygons in abstract polytopes.” 2015. Web. 23 Aug 2019.

Vancouver:

Scheidwasser I. Contractions of polygons in abstract polytopes. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2019 Aug 23]. Available from: http://hdl.handle.net/2047/D20194153.

Council of Science Editors:

Scheidwasser I. Contractions of polygons in abstract polytopes. [Doctoral Dissertation]. Northeastern University; 2015. Available from: http://hdl.handle.net/2047/D20194153

[1] [2] [3] [4] [5] [6]

.