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:(Geometry Data processing ). Showing records 1 – 30 of 57739 total matches.

[1] [2] [3] [4] [5] … [1925]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


Rutgers University

1. Zhao, Jihui, 1971-. Partitioning problems in discrete and computational geometry:.

Degree: PhD, Computer Science, 2010, Rutgers University

Many interesting problems in Discrete and Computational Geometry involve partitioning. A main question is whether a given set, or sets, may be separated into parts… (more)

Subjects/Keywords: Discrete geometry; Geometry – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, Jihui, 1. (2010). Partitioning problems in discrete and computational geometry:. (Doctoral Dissertation). Rutgers University. Retrieved from http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052168

Chicago Manual of Style (16th Edition):

Zhao, Jihui, 1971-. “Partitioning problems in discrete and computational geometry:.” 2010. Doctoral Dissertation, Rutgers University. Accessed December 09, 2019. http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052168.

MLA Handbook (7th Edition):

Zhao, Jihui, 1971-. “Partitioning problems in discrete and computational geometry:.” 2010. Web. 09 Dec 2019.

Vancouver:

Zhao, Jihui 1. Partitioning problems in discrete and computational geometry:. [Internet] [Doctoral dissertation]. Rutgers University; 2010. [cited 2019 Dec 09]. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052168.

Council of Science Editors:

Zhao, Jihui 1. Partitioning problems in discrete and computational geometry:. [Doctoral Dissertation]. Rutgers University; 2010. Available from: http://hdl.rutgers.edu/1782.2/rucore10001600001.ETD.000052168


University of Hong Kong

2. Zheng, Wenni. Studies on geometric shape reconstruction.

Degree: PhD, 2015, University of Hong Kong

This thesis, on geometric shape modeling problems, contains two major chapters. In the first chapter, we propose a fast method for fitting planar Bspline curves… (more)

Subjects/Keywords: Geometry - Data processing; Computer graphics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zheng, W. (2015). Studies on geometric shape reconstruction. (Doctoral Dissertation). University of Hong Kong. Retrieved from Zheng, W. [郑文妮]. (2015). Studies on geometric shape reconstruction. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5731099 ; http://hdl.handle.net/10722/224647

Chicago Manual of Style (16th Edition):

Zheng, Wenni. “Studies on geometric shape reconstruction.” 2015. Doctoral Dissertation, University of Hong Kong. Accessed December 09, 2019. Zheng, W. [郑文妮]. (2015). Studies on geometric shape reconstruction. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5731099 ; http://hdl.handle.net/10722/224647.

MLA Handbook (7th Edition):

Zheng, Wenni. “Studies on geometric shape reconstruction.” 2015. Web. 09 Dec 2019.

Vancouver:

Zheng W. Studies on geometric shape reconstruction. [Internet] [Doctoral dissertation]. University of Hong Kong; 2015. [cited 2019 Dec 09]. Available from: Zheng, W. [郑文妮]. (2015). Studies on geometric shape reconstruction. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5731099 ; http://hdl.handle.net/10722/224647.

Council of Science Editors:

Zheng W. Studies on geometric shape reconstruction. [Doctoral Dissertation]. University of Hong Kong; 2015. Available from: Zheng, W. [郑文妮]. (2015). Studies on geometric shape reconstruction. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5731099 ; http://hdl.handle.net/10722/224647


University of Hong Kong

3. Pan, Hao. From geometry processing to surface modeling.

Degree: PhD, 2015, University of Hong Kong

Geometry processing has witnessed tremendous development in the last few decades. Starting from acquiring 3D data of real life objects, people have developed practical methods… (more)

Subjects/Keywords: Geometrical models; Geometry - Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pan, H. (2015). From geometry processing to surface modeling. (Doctoral Dissertation). University of Hong Kong. Retrieved from Pan, H. [潘浩]. (2015). From geometry processing to surface modeling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5435651 ; http://dx.doi.org/10.5353/th_b5435651 ; http://hdl.handle.net/10722/209486

Chicago Manual of Style (16th Edition):

Pan, Hao. “From geometry processing to surface modeling.” 2015. Doctoral Dissertation, University of Hong Kong. Accessed December 09, 2019. Pan, H. [潘浩]. (2015). From geometry processing to surface modeling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5435651 ; http://dx.doi.org/10.5353/th_b5435651 ; http://hdl.handle.net/10722/209486.

MLA Handbook (7th Edition):

Pan, Hao. “From geometry processing to surface modeling.” 2015. Web. 09 Dec 2019.

Vancouver:

Pan H. From geometry processing to surface modeling. [Internet] [Doctoral dissertation]. University of Hong Kong; 2015. [cited 2019 Dec 09]. Available from: Pan, H. [潘浩]. (2015). From geometry processing to surface modeling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5435651 ; http://dx.doi.org/10.5353/th_b5435651 ; http://hdl.handle.net/10722/209486.

Council of Science Editors:

Pan H. From geometry processing to surface modeling. [Doctoral Dissertation]. University of Hong Kong; 2015. Available from: Pan, H. [潘浩]. (2015). From geometry processing to surface modeling. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b5435651 ; http://dx.doi.org/10.5353/th_b5435651 ; http://hdl.handle.net/10722/209486


Hong Kong University of Science and Technology

4. 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 December 09, 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. 09 Dec 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 Dec 09]. 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


McGill University

5. Doskas, Michael. Various stabbing problems in computational geometry.

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

Subjects/Keywords: Geometry  – Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Doskas, M. (1987). Various stabbing problems in computational geometry. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile66153.pdf

Chicago Manual of Style (16th Edition):

Doskas, Michael. “Various stabbing problems in computational geometry.” 1987. Masters Thesis, McGill University. Accessed December 09, 2019. http://digitool.library.mcgill.ca/thesisfile66153.pdf.

MLA Handbook (7th Edition):

Doskas, Michael. “Various stabbing problems in computational geometry.” 1987. Web. 09 Dec 2019.

Vancouver:

Doskas M. Various stabbing problems in computational geometry. [Internet] [Masters thesis]. McGill University; 1987. [cited 2019 Dec 09]. Available from: http://digitool.library.mcgill.ca/thesisfile66153.pdf.

Council of Science Editors:

Doskas M. Various stabbing problems in computational geometry. [Masters Thesis]. McGill University; 1987. Available from: http://digitool.library.mcgill.ca/thesisfile66153.pdf


McGill University

6. ElGindy, Hossam A. Hierarchical decomposition of polygons with applications.

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

Subjects/Keywords: Geometry  – Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

ElGindy, H. A. (1985). Hierarchical decomposition of polygons with applications. (Doctoral Dissertation). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile72756.pdf

Chicago Manual of Style (16th Edition):

ElGindy, Hossam A. “Hierarchical decomposition of polygons with applications.” 1985. Doctoral Dissertation, McGill University. Accessed December 09, 2019. http://digitool.library.mcgill.ca/thesisfile72756.pdf.

MLA Handbook (7th Edition):

ElGindy, Hossam A. “Hierarchical decomposition of polygons with applications.” 1985. Web. 09 Dec 2019.

Vancouver:

ElGindy HA. Hierarchical decomposition of polygons with applications. [Internet] [Doctoral dissertation]. McGill University; 1985. [cited 2019 Dec 09]. Available from: http://digitool.library.mcgill.ca/thesisfile72756.pdf.

Council of Science Editors:

ElGindy HA. Hierarchical decomposition of polygons with applications. [Doctoral Dissertation]. McGill University; 1985. Available from: http://digitool.library.mcgill.ca/thesisfile72756.pdf


McGill University

7. Rappaport, David, 1955-. The complexity of computing simple circuits in the plane.

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

As far back as Euclid's ruler and compass constructions, computation and geometry have been domains for the exploration and development of fundamental mathematical concepts and… (more)

Subjects/Keywords: Geometry  – Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rappaport, David, 1. (1986). The complexity of computing simple circuits in the plane. (Doctoral Dissertation). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile75339.pdf

Chicago Manual of Style (16th Edition):

Rappaport, David, 1955-. “The complexity of computing simple circuits in the plane.” 1986. Doctoral Dissertation, McGill University. Accessed December 09, 2019. http://digitool.library.mcgill.ca/thesisfile75339.pdf.

MLA Handbook (7th Edition):

Rappaport, David, 1955-. “The complexity of computing simple circuits in the plane.” 1986. Web. 09 Dec 2019.

Vancouver:

Rappaport, David 1. The complexity of computing simple circuits in the plane. [Internet] [Doctoral dissertation]. McGill University; 1986. [cited 2019 Dec 09]. Available from: http://digitool.library.mcgill.ca/thesisfile75339.pdf.

Council of Science Editors:

Rappaport, David 1. The complexity of computing simple circuits in the plane. [Doctoral Dissertation]. McGill University; 1986. Available from: http://digitool.library.mcgill.ca/thesisfile75339.pdf


Drexel University

8. Oxholm, Geoffrey. Reconstructing Geometry from Its Latent Structures.

Degree: 2014, Drexel University

Our world is full of objects with complex shapes and structures. Through extensive experience humans quickly develop an intuition about how objects are shaped, and… (more)

Subjects/Keywords: Computer science; Geometry – Data processing; Geometrical constructions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oxholm, G. (2014). Reconstructing Geometry from Its Latent Structures. (Thesis). Drexel University. Retrieved from http://hdl.handle.net/1860/4562

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

Oxholm, Geoffrey. “Reconstructing Geometry from Its Latent Structures.” 2014. Thesis, Drexel University. Accessed December 09, 2019. http://hdl.handle.net/1860/4562.

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

MLA Handbook (7th Edition):

Oxholm, Geoffrey. “Reconstructing Geometry from Its Latent Structures.” 2014. Web. 09 Dec 2019.

Vancouver:

Oxholm G. Reconstructing Geometry from Its Latent Structures. [Internet] [Thesis]. Drexel University; 2014. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1860/4562.

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

Council of Science Editors:

Oxholm G. Reconstructing Geometry from Its Latent Structures. [Thesis]. Drexel University; 2014. Available from: http://hdl.handle.net/1860/4562

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

9. Zheng, Youyi. Semantic-based interactive shape analysis and manipulation.

Degree: 2011, Hong Kong University of Science and Technology

 Geometric modeling is a fundamental problem in computer graphics. The continuous growth of 3D models in public repositories has shifted research focus from computing local,… (more)

Subjects/Keywords: Computer graphics; Geometrical models  – Data processing; Geometry  – Data processing; Form perception  – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zheng, Y. (2011). Semantic-based interactive shape analysis and manipulation. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1155200 ; http://repository.ust.hk/ir/bitstream/1783.1-7325/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):

Zheng, Youyi. “Semantic-based interactive shape analysis and manipulation.” 2011. Thesis, Hong Kong University of Science and Technology. Accessed December 09, 2019. https://doi.org/10.14711/thesis-b1155200 ; http://repository.ust.hk/ir/bitstream/1783.1-7325/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):

Zheng, Youyi. “Semantic-based interactive shape analysis and manipulation.” 2011. Web. 09 Dec 2019.

Vancouver:

Zheng Y. Semantic-based interactive shape analysis and manipulation. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2011. [cited 2019 Dec 09]. Available from: https://doi.org/10.14711/thesis-b1155200 ; http://repository.ust.hk/ir/bitstream/1783.1-7325/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:

Zheng Y. Semantic-based interactive shape analysis and manipulation. [Thesis]. Hong Kong University of Science and Technology; 2011. Available from: https://doi.org/10.14711/thesis-b1155200 ; http://repository.ust.hk/ir/bitstream/1783.1-7325/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

10. Yiu, Siu-ming. Tight bound edge guard results on art gallery problems.

Degree: PhD, 1996, University of Hong Kong

published_or_final_version

Computer Science

Doctoral

Doctor of Philosophy

Subjects/Keywords: Combinatorial geometry.; Geometry - Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yiu, S. (1996). Tight bound edge guard results on art gallery problems. (Doctoral Dissertation). University of Hong Kong. Retrieved from Yiu, S. [姚兆明]. (1996). Tight bound edge guard results on art gallery problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3123641 ; http://dx.doi.org/10.5353/th_b3123641 ; http://hdl.handle.net/10722/34917

Chicago Manual of Style (16th Edition):

Yiu, Siu-ming. “Tight bound edge guard results on art gallery problems.” 1996. Doctoral Dissertation, University of Hong Kong. Accessed December 09, 2019. Yiu, S. [姚兆明]. (1996). Tight bound edge guard results on art gallery problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3123641 ; http://dx.doi.org/10.5353/th_b3123641 ; http://hdl.handle.net/10722/34917.

MLA Handbook (7th Edition):

Yiu, Siu-ming. “Tight bound edge guard results on art gallery problems.” 1996. Web. 09 Dec 2019.

Vancouver:

Yiu S. Tight bound edge guard results on art gallery problems. [Internet] [Doctoral dissertation]. University of Hong Kong; 1996. [cited 2019 Dec 09]. Available from: Yiu, S. [姚兆明]. (1996). Tight bound edge guard results on art gallery problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3123641 ; http://dx.doi.org/10.5353/th_b3123641 ; http://hdl.handle.net/10722/34917.

Council of Science Editors:

Yiu S. Tight bound edge guard results on art gallery problems. [Doctoral Dissertation]. University of Hong Kong; 1996. Available from: Yiu, S. [姚兆明]. (1996). Tight bound edge guard results on art gallery problems. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b3123641 ; http://dx.doi.org/10.5353/th_b3123641 ; http://hdl.handle.net/10722/34917


Drexel University

11. Li, Chenxi. 3D Building Synthesis Based on Images and Affine Invariant Salient Features.

Degree: 2017, Drexel University

In this thesis, we introduce a method to synthesize and recognize buildings using a set of at least two 2D images taken from different views.… (more)

Subjects/Keywords: Electrical engineering; Image processing – Digital techniques; Geometry, Affine – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, C. (2017). 3D Building Synthesis Based on Images and Affine Invariant Salient Features. (Thesis). Drexel University. Retrieved from http://hdl.handle.net/1860/idea:7575

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

Li, Chenxi. “3D Building Synthesis Based on Images and Affine Invariant Salient Features.” 2017. Thesis, Drexel University. Accessed December 09, 2019. http://hdl.handle.net/1860/idea:7575.

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

MLA Handbook (7th Edition):

Li, Chenxi. “3D Building Synthesis Based on Images and Affine Invariant Salient Features.” 2017. Web. 09 Dec 2019.

Vancouver:

Li C. 3D Building Synthesis Based on Images and Affine Invariant Salient Features. [Internet] [Thesis]. Drexel University; 2017. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/1860/idea:7575.

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

Council of Science Editors:

Li C. 3D Building Synthesis Based on Images and Affine Invariant Salient Features. [Thesis]. Drexel University; 2017. Available from: http://hdl.handle.net/1860/idea:7575

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


Florida Atlantic University

12. Bulj, Djordje. A study of divisors and algebras on a double cover of the affine plane.

Degree: PhD, 2012, Florida Atlantic University

Summary: An algebraic surface defined by an equation of the form z2 = (x+a1y) ... (x + any) (x - 1) is studied, from both… (more)

Subjects/Keywords: Algebraic number theory; Geometry – Data processing; Noncommutative differential geometry; Mathematical physics; Curves, Algebraic; Commutative rings

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bulj, D. (2012). A study of divisors and algebras on a double cover of the affine plane. (Doctoral Dissertation). Florida Atlantic University. Retrieved from http://purl.flvc.org/FAU/3355618

Chicago Manual of Style (16th Edition):

Bulj, Djordje. “A study of divisors and algebras on a double cover of the affine plane.” 2012. Doctoral Dissertation, Florida Atlantic University. Accessed December 09, 2019. http://purl.flvc.org/FAU/3355618.

MLA Handbook (7th Edition):

Bulj, Djordje. “A study of divisors and algebras on a double cover of the affine plane.” 2012. Web. 09 Dec 2019.

Vancouver:

Bulj D. A study of divisors and algebras on a double cover of the affine plane. [Internet] [Doctoral dissertation]. Florida Atlantic University; 2012. [cited 2019 Dec 09]. Available from: http://purl.flvc.org/FAU/3355618.

Council of Science Editors:

Bulj D. A study of divisors and algebras on a double cover of the affine plane. [Doctoral Dissertation]. Florida Atlantic University; 2012. Available from: http://purl.flvc.org/FAU/3355618


Johannes Gutenberg Universität Mainz

13. Hemmer, Michael. Exact computation of the adjacency graph of an arrangement of quadrics.

Degree: 2008, Johannes Gutenberg Universität Mainz

Präsentiert wird ein vollständiger, exakter und effizienter Algorithmus zur Berechnung des Nachbarschaftsgraphen eines Arrangements von Quadriken (Algebraische Flächen vom Grad 2). Dies ist ein wichtiger… (more)

Subjects/Keywords: Computational Geometry, Generic Programming, CGAL; Data processing Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hemmer, M. (2008). Exact computation of the adjacency graph of an arrangement of quadrics. (Doctoral Dissertation). Johannes Gutenberg Universität Mainz. Retrieved from http://ubm.opus.hbz-nrw.de/volltexte/2008/1641/

Chicago Manual of Style (16th Edition):

Hemmer, Michael. “Exact computation of the adjacency graph of an arrangement of quadrics.” 2008. Doctoral Dissertation, Johannes Gutenberg Universität Mainz. Accessed December 09, 2019. http://ubm.opus.hbz-nrw.de/volltexte/2008/1641/.

MLA Handbook (7th Edition):

Hemmer, Michael. “Exact computation of the adjacency graph of an arrangement of quadrics.” 2008. Web. 09 Dec 2019.

Vancouver:

Hemmer M. Exact computation of the adjacency graph of an arrangement of quadrics. [Internet] [Doctoral dissertation]. Johannes Gutenberg Universität Mainz; 2008. [cited 2019 Dec 09]. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2008/1641/.

Council of Science Editors:

Hemmer M. Exact computation of the adjacency graph of an arrangement of quadrics. [Doctoral Dissertation]. Johannes Gutenberg Universität Mainz; 2008. Available from: http://ubm.opus.hbz-nrw.de/volltexte/2008/1641/


Hong Kong University of Science and Technology

14. 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 December 09, 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. 09 Dec 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 Dec 09]. 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

15. Xia, Jian. New results in nearest neighbor and range searching.

Degree: 2010, Hong Kong University of Science and Technology

 In this thesis, we tackle challenging open questions in the area of nearest neighbor and range searching. Nearest neighbor and range searching are among the… (more)

Subjects/Keywords: Nearest neighbor analysis (Statistics); Approximation theory; Geometry  – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xia, J. (2010). New results in nearest neighbor and range searching. (Thesis). Hong Kong University of Science and Technology. Retrieved from https://doi.org/10.14711/thesis-b1106562 ; http://repository.ust.hk/ir/bitstream/1783.1-6746/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):

Xia, Jian. “New results in nearest neighbor and range searching.” 2010. Thesis, Hong Kong University of Science and Technology. Accessed December 09, 2019. https://doi.org/10.14711/thesis-b1106562 ; http://repository.ust.hk/ir/bitstream/1783.1-6746/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):

Xia, Jian. “New results in nearest neighbor and range searching.” 2010. Web. 09 Dec 2019.

Vancouver:

Xia J. New results in nearest neighbor and range searching. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2010. [cited 2019 Dec 09]. Available from: https://doi.org/10.14711/thesis-b1106562 ; http://repository.ust.hk/ir/bitstream/1783.1-6746/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:

Xia J. New results in nearest neighbor and range searching. [Thesis]. Hong Kong University of Science and Technology; 2010. Available from: https://doi.org/10.14711/thesis-b1106562 ; http://repository.ust.hk/ir/bitstream/1783.1-6746/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

16. Zhao, Rongyao. An NP-hardness result for moving robot arms with rectangular links.

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

Subjects/Keywords: Robotics.; Geometry  – Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, R. (1986). An NP-hardness result for moving robot arms with rectangular links. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile65407.pdf

Chicago Manual of Style (16th Edition):

Zhao, Rongyao. “An NP-hardness result for moving robot arms with rectangular links.” 1986. Masters Thesis, McGill University. Accessed December 09, 2019. http://digitool.library.mcgill.ca/thesisfile65407.pdf.

MLA Handbook (7th Edition):

Zhao, Rongyao. “An NP-hardness result for moving robot arms with rectangular links.” 1986. Web. 09 Dec 2019.

Vancouver:

Zhao R. An NP-hardness result for moving robot arms with rectangular links. [Internet] [Masters thesis]. McGill University; 1986. [cited 2019 Dec 09]. Available from: http://digitool.library.mcgill.ca/thesisfile65407.pdf.

Council of Science Editors:

Zhao R. An NP-hardness result for moving robot arms with rectangular links. [Masters Thesis]. McGill University; 1986. Available from: http://digitool.library.mcgill.ca/thesisfile65407.pdf


McGill University

17. Egyed, Peter, 1962-. Hidden-surface removal in polyhedral-cross-sections.

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

Subjects/Keywords: Computer graphics.; Geometry  – Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Egyed, Peter, 1. (1987). Hidden-surface removal in polyhedral-cross-sections. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile63763.pdf

Chicago Manual of Style (16th Edition):

Egyed, Peter, 1962-. “Hidden-surface removal in polyhedral-cross-sections.” 1987. Masters Thesis, McGill University. Accessed December 09, 2019. http://digitool.library.mcgill.ca/thesisfile63763.pdf.

MLA Handbook (7th Edition):

Egyed, Peter, 1962-. “Hidden-surface removal in polyhedral-cross-sections.” 1987. Web. 09 Dec 2019.

Vancouver:

Egyed, Peter 1. Hidden-surface removal in polyhedral-cross-sections. [Internet] [Masters thesis]. McGill University; 1987. [cited 2019 Dec 09]. Available from: http://digitool.library.mcgill.ca/thesisfile63763.pdf.

Council of Science Editors:

Egyed, Peter 1. Hidden-surface removal in polyhedral-cross-sections. [Masters Thesis]. McGill University; 1987. Available from: http://digitool.library.mcgill.ca/thesisfile63763.pdf


McGill University

18. 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 December 09, 2019. http://digitool.library.mcgill.ca/thesisfile71872.pdf.

MLA Handbook (7th Edition):

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

Vancouver:

Sack J. Rectilinear computational geometry. [Internet] [Doctoral dissertation]. McGill University; 1984. [cited 2019 Dec 09]. 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


University of Texas – Austin

19. Choi, Sunghee. Practical Delaunay triangulation algorithms for surface reconstruction and related problems.

Degree: PhD, Computer Sciences, 2003, University of Texas – Austin

 The Delaunay triangulation is one of the fundamental problems in computational geometry, dual to the well-known Voronoi diagram. It has numerous applications in various disciplines… (more)

Subjects/Keywords: Triangulation; Geometry – Data processing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choi, S. (2003). Practical Delaunay triangulation algorithms for surface reconstruction and related problems. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/505

Chicago Manual of Style (16th Edition):

Choi, Sunghee. “Practical Delaunay triangulation algorithms for surface reconstruction and related problems.” 2003. Doctoral Dissertation, University of Texas – Austin. Accessed December 09, 2019. http://hdl.handle.net/2152/505.

MLA Handbook (7th Edition):

Choi, Sunghee. “Practical Delaunay triangulation algorithms for surface reconstruction and related problems.” 2003. Web. 09 Dec 2019.

Vancouver:

Choi S. Practical Delaunay triangulation algorithms for surface reconstruction and related problems. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2003. [cited 2019 Dec 09]. Available from: http://hdl.handle.net/2152/505.

Council of Science Editors:

Choi S. Practical Delaunay triangulation algorithms for surface reconstruction and related problems. [Doctoral Dissertation]. University of Texas – Austin; 2003. Available from: http://hdl.handle.net/2152/505


Drexel University

20. Hajieghrary, Hadi. Geometric Control of a Constrained System: Cooperative Action with a Coordinated Multiagent System.

Degree: 2017, Drexel University

Abstract In this work we examine a differential geometric approach towards the synthesis of trajectory for each member of a team of autonomous surface vehicles… (more)

Subjects/Keywords: Mechanical engineering; Autonomous vehicles; Electric power distribution – Automation; Electronic data processing – Distributed processing; Geometry, Differential

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hajieghrary, H. (2017). Geometric Control of a Constrained System: Cooperative Action with a Coordinated Multiagent System. (Thesis). Drexel University. Retrieved from https://idea.library.drexel.edu/islandora/object/idea%3A7942

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

Hajieghrary, Hadi. “Geometric Control of a Constrained System: Cooperative Action with a Coordinated Multiagent System.” 2017. Thesis, Drexel University. Accessed December 09, 2019. https://idea.library.drexel.edu/islandora/object/idea%3A7942.

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

MLA Handbook (7th Edition):

Hajieghrary, Hadi. “Geometric Control of a Constrained System: Cooperative Action with a Coordinated Multiagent System.” 2017. Web. 09 Dec 2019.

Vancouver:

Hajieghrary H. Geometric Control of a Constrained System: Cooperative Action with a Coordinated Multiagent System. [Internet] [Thesis]. Drexel University; 2017. [cited 2019 Dec 09]. Available from: https://idea.library.drexel.edu/islandora/object/idea%3A7942.

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

Council of Science Editors:

Hajieghrary H. Geometric Control of a Constrained System: Cooperative Action with a Coordinated Multiagent System. [Thesis]. Drexel University; 2017. Available from: https://idea.library.drexel.edu/islandora/object/idea%3A7942

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


University of Hong Kong

21. 馮秉遠.; Fung, Ping-yuen. Approximation for minimum triangulations of convex polyhedra.

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

toc

abstract

published_or_final_version

Computer Science and Information Systems

Master

Master of Philosophy

Advisors/Committee Members: Chin, FYL.

Subjects/Keywords: Decomposition method.; Geometry - Data processing.; Polyhedra.; Combinatorial geometry.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

馮秉遠.; Fung, P. (2001). Approximation for minimum triangulations of convex polyhedra. (Masters Thesis). University of Hong Kong. Retrieved from Fung, P. [馮秉遠]. (2001). Approximation for minimum triangulations of convex polyhedra. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b2980996 ; http://dx.doi.org/10.5353/th_b2980996 ; http://hdl.handle.net/10722/31849

Chicago Manual of Style (16th Edition):

馮秉遠.; Fung, Ping-yuen. “Approximation for minimum triangulations of convex polyhedra.” 2001. Masters Thesis, University of Hong Kong. Accessed December 09, 2019. Fung, P. [馮秉遠]. (2001). Approximation for minimum triangulations of convex polyhedra. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b2980996 ; http://dx.doi.org/10.5353/th_b2980996 ; http://hdl.handle.net/10722/31849.

MLA Handbook (7th Edition):

馮秉遠.; Fung, Ping-yuen. “Approximation for minimum triangulations of convex polyhedra.” 2001. Web. 09 Dec 2019.

Vancouver:

馮秉遠.; Fung P. Approximation for minimum triangulations of convex polyhedra. [Internet] [Masters thesis]. University of Hong Kong; 2001. [cited 2019 Dec 09]. Available from: Fung, P. [馮秉遠]. (2001). Approximation for minimum triangulations of convex polyhedra. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b2980996 ; http://dx.doi.org/10.5353/th_b2980996 ; http://hdl.handle.net/10722/31849.

Council of Science Editors:

馮秉遠.; Fung P. Approximation for minimum triangulations of convex polyhedra. [Masters Thesis]. University of Hong Kong; 2001. Available from: Fung, P. [馮秉遠]. (2001). Approximation for minimum triangulations of convex polyhedra. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b2980996 ; http://dx.doi.org/10.5353/th_b2980996 ; http://hdl.handle.net/10722/31849


University of Hong Kong

22. Poon, Chun-ho. Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization.

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

abstract

published_or_final_version

toc

Computer Science and Information Systems

Master

Master of Philosophy

Subjects/Keywords: Computation geometry.; Computer graphics - Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Poon, C. (2000). Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization. (Masters Thesis). University of Hong Kong. Retrieved from Poon, C. [潘仲豪]. (2000). Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b2974328 ; http://dx.doi.org/10.5353/th_b2974328 ; http://hdl.handle.net/10722/30792

Chicago Manual of Style (16th Edition):

Poon, Chun-ho. “Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization.” 2000. Masters Thesis, University of Hong Kong. Accessed December 09, 2019. Poon, C. [潘仲豪]. (2000). Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b2974328 ; http://dx.doi.org/10.5353/th_b2974328 ; http://hdl.handle.net/10722/30792.

MLA Handbook (7th Edition):

Poon, Chun-ho. “Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization.” 2000. Web. 09 Dec 2019.

Vancouver:

Poon C. Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization. [Internet] [Masters thesis]. University of Hong Kong; 2000. [cited 2019 Dec 09]. Available from: Poon, C. [潘仲豪]. (2000). Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b2974328 ; http://dx.doi.org/10.5353/th_b2974328 ; http://hdl.handle.net/10722/30792.

Council of Science Editors:

Poon C. Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization. [Masters Thesis]. University of Hong Kong; 2000. Available from: Poon, C. [潘仲豪]. (2000). Efficient occlusion culling and non-refractive transparency rendering for interactive computer visualization. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b2974328 ; http://dx.doi.org/10.5353/th_b2974328 ; http://hdl.handle.net/10722/30792


Simon Fraser University

23. Bremner, David Dylan. Point visibility graphs and restricted-orientation polygon covering.

Degree: 1993, Simon Fraser University

Subjects/Keywords: Geometry  – Data processing.; Polygons.; Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bremner, D. D. (1993). Point visibility graphs and restricted-orientation polygon covering. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/4468

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

Bremner, David Dylan. “Point visibility graphs and restricted-orientation polygon covering.” 1993. Thesis, Simon Fraser University. Accessed December 09, 2019. http://summit.sfu.ca/item/4468.

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

MLA Handbook (7th Edition):

Bremner, David Dylan. “Point visibility graphs and restricted-orientation polygon covering.” 1993. Web. 09 Dec 2019.

Vancouver:

Bremner DD. Point visibility graphs and restricted-orientation polygon covering. [Internet] [Thesis]. Simon Fraser University; 1993. [cited 2019 Dec 09]. Available from: http://summit.sfu.ca/item/4468.

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

Council of Science Editors:

Bremner DD. Point visibility graphs and restricted-orientation polygon covering. [Thesis]. Simon Fraser University; 1993. Available from: http://summit.sfu.ca/item/4468

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


Simon Fraser University

24. MacDonald, Glenn. Isomorphism and layout of spiral polygons.

Degree: 1993, Simon Fraser University

Subjects/Keywords: Geometry  – Data processing.; Polygons.; Graph theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

MacDonald, G. (1993). Isomorphism and layout of spiral polygons. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/4470

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

MacDonald, Glenn. “Isomorphism and layout of spiral polygons.” 1993. Thesis, Simon Fraser University. Accessed December 09, 2019. http://summit.sfu.ca/item/4470.

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

MLA Handbook (7th Edition):

MacDonald, Glenn. “Isomorphism and layout of spiral polygons.” 1993. Web. 09 Dec 2019.

Vancouver:

MacDonald G. Isomorphism and layout of spiral polygons. [Internet] [Thesis]. Simon Fraser University; 1993. [cited 2019 Dec 09]. Available from: http://summit.sfu.ca/item/4470.

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

Council of Science Editors:

MacDonald G. Isomorphism and layout of spiral polygons. [Thesis]. Simon Fraser University; 1993. Available from: http://summit.sfu.ca/item/4470

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


Simon Fraser University

25. Guo, Zhongmin. An efficient algorithm for planar subdivision intersection problems.

Degree: 1994, Simon Fraser University

Subjects/Keywords: Graph theory.; Geometry  – Data processing.; Algorithms.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, Z. (1994). An efficient algorithm for planar subdivision intersection problems. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/5000

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

Guo, Zhongmin. “An efficient algorithm for planar subdivision intersection problems.” 1994. Thesis, Simon Fraser University. Accessed December 09, 2019. http://summit.sfu.ca/item/5000.

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

MLA Handbook (7th Edition):

Guo, Zhongmin. “An efficient algorithm for planar subdivision intersection problems.” 1994. Web. 09 Dec 2019.

Vancouver:

Guo Z. An efficient algorithm for planar subdivision intersection problems. [Internet] [Thesis]. Simon Fraser University; 1994. [cited 2019 Dec 09]. Available from: http://summit.sfu.ca/item/5000.

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

Council of Science Editors:

Guo Z. An efficient algorithm for planar subdivision intersection problems. [Thesis]. Simon Fraser University; 1994. Available from: http://summit.sfu.ca/item/5000

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


Simon Fraser University

26. Franklin, Paul. Optimal rectangle covers for convex rectilinear polygon.

Degree: 1986, Simon Fraser University

Subjects/Keywords: Geometry  – Data processing.; Computer graphics.; Rectangles.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Franklin, P. (1986). Optimal rectangle covers for convex rectilinear polygon. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/5922

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

Franklin, Paul. “Optimal rectangle covers for convex rectilinear polygon.” 1986. Thesis, Simon Fraser University. Accessed December 09, 2019. http://summit.sfu.ca/item/5922.

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

MLA Handbook (7th Edition):

Franklin, Paul. “Optimal rectangle covers for convex rectilinear polygon.” 1986. Web. 09 Dec 2019.

Vancouver:

Franklin P. Optimal rectangle covers for convex rectilinear polygon. [Internet] [Thesis]. Simon Fraser University; 1986. [cited 2019 Dec 09]. Available from: http://summit.sfu.ca/item/5922.

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

Council of Science Editors:

Franklin P. Optimal rectangle covers for convex rectilinear polygon. [Thesis]. Simon Fraser University; 1986. Available from: http://summit.sfu.ca/item/5922

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


Simon Fraser University

27. Zorbas, John. Applications of set addition to computational geometry and robot motion planning.

Degree: 1986, Simon Fraser University

Subjects/Keywords: Geometry  – Data processing.; Robots.; Set theory.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zorbas, J. (1986). Applications of set addition to computational geometry and robot motion planning. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/6025

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

Zorbas, John. “Applications of set addition to computational geometry and robot motion planning.” 1986. Thesis, Simon Fraser University. Accessed December 09, 2019. http://summit.sfu.ca/item/6025.

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

MLA Handbook (7th Edition):

Zorbas, John. “Applications of set addition to computational geometry and robot motion planning.” 1986. Web. 09 Dec 2019.

Vancouver:

Zorbas J. Applications of set addition to computational geometry and robot motion planning. [Internet] [Thesis]. Simon Fraser University; 1986. [cited 2019 Dec 09]. Available from: http://summit.sfu.ca/item/6025.

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

Council of Science Editors:

Zorbas J. Applications of set addition to computational geometry and robot motion planning. [Thesis]. Simon Fraser University; 1986. Available from: http://summit.sfu.ca/item/6025

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


Simon Fraser University

28. Belleville, Patrice. A study of convex covers in two or more dimensions.

Degree: 1995, Simon Fraser University

Subjects/Keywords: Geometry  – Data processing.; Computer graphics.; Polygons.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Belleville, P. (1995). A study of convex covers in two or more dimensions. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/6812

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

Belleville, Patrice. “A study of convex covers in two or more dimensions.” 1995. Thesis, Simon Fraser University. Accessed December 09, 2019. http://summit.sfu.ca/item/6812.

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

MLA Handbook (7th Edition):

Belleville, Patrice. “A study of convex covers in two or more dimensions.” 1995. Web. 09 Dec 2019.

Vancouver:

Belleville P. A study of convex covers in two or more dimensions. [Internet] [Thesis]. Simon Fraser University; 1995. [cited 2019 Dec 09]. Available from: http://summit.sfu.ca/item/6812.

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

Council of Science Editors:

Belleville P. A study of convex covers in two or more dimensions. [Thesis]. Simon Fraser University; 1995. Available from: http://summit.sfu.ca/item/6812

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


University of Alberta

29. Wang, Wenping. Results on conics and quadrics in computer aided geometric designs.

Degree: PhD, Department of Computing Science, 1992, University of Alberta

Subjects/Keywords: Geometry – Data processing.; Conics, Spherical – Data processing.; Quadrics – Data processing.; Computer-aided design.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, W. (1992). Results on conics and quadrics in computer aided geometric designs. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/q524jr21w

Chicago Manual of Style (16th Edition):

Wang, Wenping. “Results on conics and quadrics in computer aided geometric designs.” 1992. Doctoral Dissertation, University of Alberta. Accessed December 09, 2019. https://era.library.ualberta.ca/files/q524jr21w.

MLA Handbook (7th Edition):

Wang, Wenping. “Results on conics and quadrics in computer aided geometric designs.” 1992. Web. 09 Dec 2019.

Vancouver:

Wang W. Results on conics and quadrics in computer aided geometric designs. [Internet] [Doctoral dissertation]. University of Alberta; 1992. [cited 2019 Dec 09]. Available from: https://era.library.ualberta.ca/files/q524jr21w.

Council of Science Editors:

Wang W. Results on conics and quadrics in computer aided geometric designs. [Doctoral Dissertation]. University of Alberta; 1992. Available from: https://era.library.ualberta.ca/files/q524jr21w


McGill University

30. Rallis, Nicholas. Geometric performance evaluation of concurrency control in database systems.

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

Subjects/Keywords: Database management.; Parallel processing (Electronic computers); Geometry  – Data processing.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rallis, N. (1984). Geometric performance evaluation of concurrency control in database systems. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile65313.pdf

Chicago Manual of Style (16th Edition):

Rallis, Nicholas. “Geometric performance evaluation of concurrency control in database systems.” 1984. Masters Thesis, McGill University. Accessed December 09, 2019. http://digitool.library.mcgill.ca/thesisfile65313.pdf.

MLA Handbook (7th Edition):

Rallis, Nicholas. “Geometric performance evaluation of concurrency control in database systems.” 1984. Web. 09 Dec 2019.

Vancouver:

Rallis N. Geometric performance evaluation of concurrency control in database systems. [Internet] [Masters thesis]. McGill University; 1984. [cited 2019 Dec 09]. Available from: http://digitool.library.mcgill.ca/thesisfile65313.pdf.

Council of Science Editors:

Rallis N. Geometric performance evaluation of concurrency control in database systems. [Masters Thesis]. McGill University; 1984. Available from: http://digitool.library.mcgill.ca/thesisfile65313.pdf

[1] [2] [3] [4] [5] … [1925]

.