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 165 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Texas Tech University

1. Keffer, Mary Imogene. The construction of a regular polygon of two hundred and fifty-seven sides.

Degree: 1938, Texas Tech University

Subjects/Keywords: Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Keffer, M. I. (1938). The construction of a regular polygon of two hundred and fifty-seven sides. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/8598

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):

Keffer, Mary Imogene. “The construction of a regular polygon of two hundred and fifty-seven sides.” 1938. Thesis, Texas Tech University. Accessed September 25, 2020. http://hdl.handle.net/2346/8598.

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

MLA Handbook (7th Edition):

Keffer, Mary Imogene. “The construction of a regular polygon of two hundred and fifty-seven sides.” 1938. Web. 25 Sep 2020.

Vancouver:

Keffer MI. The construction of a regular polygon of two hundred and fifty-seven sides. [Internet] [Thesis]. Texas Tech University; 1938. [cited 2020 Sep 25]. Available from: http://hdl.handle.net/2346/8598.

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

Council of Science Editors:

Keffer MI. The construction of a regular polygon of two hundred and fifty-seven sides. [Thesis]. Texas Tech University; 1938. Available from: http://hdl.handle.net/2346/8598

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


University of North Texas

2. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Heinlein DJ(J. Properties of Bicentric Circles for Three-Sided Polygons. [Internet] [Thesis]. University of North Texas; 1998. [cited 2020 Sep 25]. 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 British Columbia

3. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Stoch SL. Interactive polygon filling on a raster graphic display . [Internet] [Thesis]. University of British Columbia; 1981. [cited 2020 Sep 25]. 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


University of Akron

4. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Auger JT. Orbits of the Dissected Polygons of the Generalized Catalan Numbers. [Internet] [Masters thesis]. University of Akron; 2011. [cited 2020 Sep 25]. 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


Western Kentucky University

5. 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 September 25, 2020. https://digitalcommons.wku.edu/theses/1482.

MLA Handbook (7th Edition):

Veeramachaneni, Sai Sindhuja. “Generating Random Walks and Polygons with Thickness in Confinement.” 2015. Web. 25 Sep 2020.

Vancouver:

Veeramachaneni SS. Generating Random Walks and Polygons with Thickness in Confinement. [Internet] [Masters thesis]. Western Kentucky University; 2015. [cited 2020 Sep 25]. 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


Virginia Tech

6. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Lanz CB. The Use of Schwarz-Christoffel Transformations in Determining Acoustic Resonances. [Internet] [Masters thesis]. Virginia Tech; 2010. [cited 2020 Sep 25]. 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


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 September 25, 2020. http://hdl.handle.net/1957/2824.

MLA Handbook (7th Edition):

Trubin, Stanislav I. “Information space mapping with adaptive multiplicatively weighted Voronoi diagrams.” 2006. Web. 25 Sep 2020.

Vancouver:

Trubin SI. Information space mapping with adaptive multiplicatively weighted Voronoi diagrams. [Internet] [Masters thesis]. Oregon State University; 2006. [cited 2020 Sep 25]. 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


Texas State University – San Marcos

8. Zaporojets, Olga V. Polygon Reduction Algorithm for Layout Extraction and Parasitic Signal Calculation.

Degree: Master of Computer Science, Computer Science, 2002, Texas State University – San Marcos

 The design of a specific polygon reduction algorithm to be applied to the process of layout extraction is proposed. The algorithm is tested with the… (more)

Subjects/Keywords: Computer algorithms; Polygons

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zaporojets, O. V. (2002). Polygon Reduction Algorithm for Layout Extraction and Parasitic Signal Calculation. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/8743

Chicago Manual of Style (16th Edition):

Zaporojets, Olga V. “Polygon Reduction Algorithm for Layout Extraction and Parasitic Signal Calculation.” 2002. Masters Thesis, Texas State University – San Marcos. Accessed September 25, 2020. https://digital.library.txstate.edu/handle/10877/8743.

MLA Handbook (7th Edition):

Zaporojets, Olga V. “Polygon Reduction Algorithm for Layout Extraction and Parasitic Signal Calculation.” 2002. Web. 25 Sep 2020.

Vancouver:

Zaporojets OV. Polygon Reduction Algorithm for Layout Extraction and Parasitic Signal Calculation. [Internet] [Masters thesis]. Texas State University – San Marcos; 2002. [cited 2020 Sep 25]. Available from: https://digital.library.txstate.edu/handle/10877/8743.

Council of Science Editors:

Zaporojets OV. Polygon Reduction Algorithm for Layout Extraction and Parasitic Signal Calculation. [Masters Thesis]. Texas State University – San Marcos; 2002. Available from: https://digital.library.txstate.edu/handle/10877/8743


Hong Kong University of Science and Technology

9. 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 http://repository.ust.hk/ir/Record/1783.1-7133 ; 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 September 25, 2020. http://repository.ust.hk/ir/Record/1783.1-7133 ; 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. 25 Sep 2020.

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 2020 Sep 25]. Available from: http://repository.ust.hk/ir/Record/1783.1-7133 ; 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: http://repository.ust.hk/ir/Record/1783.1-7133 ; 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

10. 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 http://repository.ust.hk/ir/Record/1783.1-7764 ; 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 September 25, 2020. http://repository.ust.hk/ir/Record/1783.1-7764 ; 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. 25 Sep 2020.

Vancouver:

Lam C. Shape matching under rigid motion. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2012. [cited 2020 Sep 25]. Available from: http://repository.ust.hk/ir/Record/1783.1-7764 ; 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: http://repository.ust.hk/ir/Record/1783.1-7764 ; 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


Hong Kong University of Science and Technology

11. 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 http://repository.ust.hk/ir/Record/1783.1-92606 ; 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 September 25, 2020. http://repository.ust.hk/ir/Record/1783.1-92606 ; 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. 25 Sep 2020.

Vancouver:

Chan YWC. Approximate Voronoi cells over data streams. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2020 Sep 25]. Available from: http://repository.ust.hk/ir/Record/1783.1-92606 ; 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: http://repository.ust.hk/ir/Record/1783.1-92606 ; 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

12. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Batista FV. Ladrilhamentos irregulares, discos extremos e grafos de balão. [Internet] [Thesis]. Universidade Federal de Viçosa; 2012. [cited 2020 Sep 25]. 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

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

Degree: MS, Faculty of Science, 2018, 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. (2018). A Formal Proof of Feit-Higman Theorem in Agda. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/3128

Chicago Manual of Style (16th Edition):

Rao, Balaji R. “A Formal Proof of Feit-Higman Theorem in Agda.” 2018. Masters Thesis, Indian Institute of Science. Accessed September 25, 2020. http://etd.iisc.ac.in/handle/2005/3128.

MLA Handbook (7th Edition):

Rao, Balaji R. “A Formal Proof of Feit-Higman Theorem in Agda.” 2018. Web. 25 Sep 2020.

Vancouver:

Rao BR. A Formal Proof of Feit-Higman Theorem in Agda. [Internet] [Masters thesis]. Indian Institute of Science; 2018. [cited 2020 Sep 25]. Available from: http://etd.iisc.ac.in/handle/2005/3128.

Council of Science Editors:

Rao BR. A Formal Proof of Feit-Higman Theorem in Agda. [Masters Thesis]. Indian Institute of Science; 2018. Available from: http://etd.iisc.ac.in/handle/2005/3128


University of Saskatchewan

14. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Eng J. Self-avoiding polygons in (L, M)-tubes. [Internet] [Thesis]. University of Saskatchewan; 2014. [cited 2020 Sep 25]. 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

15. 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 September 25, 2020. 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. 25 Sep 2020.

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 2020 Sep 25]. 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

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

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 September 25, 2020. http://hdl.handle.net/10889/8377.

MLA Handbook (7th Edition):

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

Vancouver:

Ρέτζεκα . Η διδασκαλία της Γεωμετρίας -ιδιαίτερα της συμμετρίας των πολυγώνων- στο δημοτικό και το γυμνάσιο. [Internet] [Masters thesis]. University of Patras; 2014. [cited 2020 Sep 25]. 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


Universidade Estadual de Campinas

17. Oliveira, Gabriela Vicentini de, 1990-. Brahmagupta e quadriláteros cíclicos no ensino médio: Brahmagupta and cyclic quadrilaterals for high school.

Degree: 2015, Universidade Estadual de Campinas

 Abstract: This work presents the Brahmagupta's formula for cyclic quadrilateral (inscribed in a circle) area and an expression for their diagonals. It is also crafted… (more)

Subjects/Keywords: Geometria; Polígonos; Educação matemática; Geometry (High school); Polygons; Mathematic education

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oliveira, Gabriela Vicentini de, 1. (2015). Brahmagupta e quadriláteros cíclicos no ensino médio: Brahmagupta and cyclic quadrilaterals for high school. (Thesis). Universidade Estadual de Campinas. Retrieved from http://repositorio.unicamp.br/jspui/handle/REPOSIP/306991

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):

Oliveira, Gabriela Vicentini de, 1990-. “Brahmagupta e quadriláteros cíclicos no ensino médio: Brahmagupta and cyclic quadrilaterals for high school.” 2015. Thesis, Universidade Estadual de Campinas. Accessed September 25, 2020. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306991.

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

MLA Handbook (7th Edition):

Oliveira, Gabriela Vicentini de, 1990-. “Brahmagupta e quadriláteros cíclicos no ensino médio: Brahmagupta and cyclic quadrilaterals for high school.” 2015. Web. 25 Sep 2020.

Vancouver:

Oliveira, Gabriela Vicentini de 1. Brahmagupta e quadriláteros cíclicos no ensino médio: Brahmagupta and cyclic quadrilaterals for high school. [Internet] [Thesis]. Universidade Estadual de Campinas; 2015. [cited 2020 Sep 25]. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306991.

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

Council of Science Editors:

Oliveira, Gabriela Vicentini de 1. Brahmagupta e quadriláteros cíclicos no ensino médio: Brahmagupta and cyclic quadrilaterals for high school. [Thesis]. Universidade Estadual de Campinas; 2015. Available from: http://repositorio.unicamp.br/jspui/handle/REPOSIP/306991

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


Texas State University – San Marcos

18. Kai, Yasuharu. Selfish Herd with Moving and Non-Moving Voronoi Diagram in Two Dimensions and Application.

Degree: MS, Computer Science, 2004, Texas State University – San Marcos

 Voronoi Diagrams of moving points are applied to Selfish Herd problems. A portable C ++ implementation with graphics is described. Data gathered from simulations using… (more)

Subjects/Keywords: Voronoi polygons; Computer algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kai, Y. (2004). Selfish Herd with Moving and Non-Moving Voronoi Diagram in Two Dimensions and Application. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/10522

Chicago Manual of Style (16th Edition):

Kai, Yasuharu. “Selfish Herd with Moving and Non-Moving Voronoi Diagram in Two Dimensions and Application.” 2004. Masters Thesis, Texas State University – San Marcos. Accessed September 25, 2020. https://digital.library.txstate.edu/handle/10877/10522.

MLA Handbook (7th Edition):

Kai, Yasuharu. “Selfish Herd with Moving and Non-Moving Voronoi Diagram in Two Dimensions and Application.” 2004. Web. 25 Sep 2020.

Vancouver:

Kai Y. Selfish Herd with Moving and Non-Moving Voronoi Diagram in Two Dimensions and Application. [Internet] [Masters thesis]. Texas State University – San Marcos; 2004. [cited 2020 Sep 25]. Available from: https://digital.library.txstate.edu/handle/10877/10522.

Council of Science Editors:

Kai Y. Selfish Herd with Moving and Non-Moving Voronoi Diagram in Two Dimensions and Application. [Masters Thesis]. Texas State University – San Marcos; 2004. Available from: https://digital.library.txstate.edu/handle/10877/10522


Simon Fraser University

19. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Kaller DM. Output sensitive algorithms to compute higher-order Voroni diagrams in Euclidean D-space. [Internet] [Thesis]. Simon Fraser University; 1992. [cited 2020 Sep 25]. 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

20. 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 September 25, 2020. 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. 25 Sep 2020.

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 2020 Sep 25]. 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


Queen Mary, University of London

21. 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 September 25, 2020. 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. 25 Sep 2020.

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 2020 Sep 25]. 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


Northeastern University

22. 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 September 25, 2020. http://hdl.handle.net/2047/D20194153.

MLA Handbook (7th Edition):

Scheidwasser, Ilya. “Contractions of polygons in abstract polytopes.” 2015. Web. 25 Sep 2020.

Vancouver:

Scheidwasser I. Contractions of polygons in abstract polytopes. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2020 Sep 25]. 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


George Mason University

23. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Khan TS. Evaluating the Errors Associated with Zip Code Polygon When Employed for Spatial Analyses . [Internet] [Thesis]. George Mason University; 2013. [cited 2020 Sep 25]. 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


Hong Kong University of Science and Technology

24. 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 http://repository.ust.hk/ir/Record/1783.1-7892 ; 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 September 25, 2020. http://repository.ust.hk/ir/Record/1783.1-7892 ; 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. 25 Sep 2020.

Vancouver:

Wei X. Some algorithms for computing monotone paths with engineering applications. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2013. [cited 2020 Sep 25]. Available from: http://repository.ust.hk/ir/Record/1783.1-7892 ; 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: http://repository.ust.hk/ir/Record/1783.1-7892 ; 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

25. 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 http://repository.ust.hk/ir/Record/1783.1-5087 ; 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 September 25, 2020. http://repository.ust.hk/ir/Record/1783.1-5087 ; 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. 25 Sep 2020.

Vancouver:

Wong T. Centroidal voronoi tessellation : theorys, applications and numerical results. [Internet] [Thesis]. Hong Kong University of Science and Technology; 1999. [cited 2020 Sep 25]. Available from: http://repository.ust.hk/ir/Record/1783.1-5087 ; 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: http://repository.ust.hk/ir/Record/1783.1-5087 ; 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

26. 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 http://repository.ust.hk/ir/Record/1783.1-5691 ; 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 September 25, 2020. http://repository.ust.hk/ir/Record/1783.1-5691 ; 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. 25 Sep 2020.

Vancouver:

Cheong J. Strip decomposition of polygons. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2000. [cited 2020 Sep 25]. Available from: http://repository.ust.hk/ir/Record/1783.1-5691 ; 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: http://repository.ust.hk/ir/Record/1783.1-5691 ; 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 Victoria

27. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Ahmadi M. Modeling and analysis of wireless cognitive radio networks: a geometrical probability approach. [Internet] [Thesis]. University of Victoria; 2016. [cited 2020 Sep 25]. 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


Texas Tech University

28. Bailey, Benjamin Aaron. Area of polygons in hyperbolic geometry.

Degree: Mathematics, 2004, Texas Tech University

 Consider the Poincare model for hyperbolic geometry on the unit disc and an arbitrary n-gon in this geometry. Chapter I gives a brief introduction to… (more)

Subjects/Keywords: Geodesics (Mathematics); Hyperbolic; Polygons; Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bailey, B. A. (2004). Area of polygons in hyperbolic geometry. (Thesis). Texas Tech University. Retrieved from http://hdl.handle.net/2346/20097

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):

Bailey, Benjamin Aaron. “Area of polygons in hyperbolic geometry.” 2004. Thesis, Texas Tech University. Accessed September 25, 2020. http://hdl.handle.net/2346/20097.

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

MLA Handbook (7th Edition):

Bailey, Benjamin Aaron. “Area of polygons in hyperbolic geometry.” 2004. Web. 25 Sep 2020.

Vancouver:

Bailey BA. Area of polygons in hyperbolic geometry. [Internet] [Thesis]. Texas Tech University; 2004. [cited 2020 Sep 25]. Available from: http://hdl.handle.net/2346/20097.

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

Council of Science Editors:

Bailey BA. Area of polygons in hyperbolic geometry. [Thesis]. Texas Tech University; 2004. Available from: http://hdl.handle.net/2346/20097

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


University of British Columbia

29. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Kreykenbohm MW. Replication patterns for polygon fill algorithms . [Internet] [Thesis]. University of British Columbia; 1988. [cited 2020 Sep 25]. 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

30. 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 September 25, 2020. 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. 25 Sep 2020.

Vancouver:

Science UoLFoAa. Polygon reconstruction from visibility information . [Internet] [Thesis]. University of Lethbridge; 1996. [cited 2020 Sep 25]. 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

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

.