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:(computational geometry). Showing records 1 – 30 of 347 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Waterloo

1. Pathak, Vinayak. Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions.

Degree: 2011, University of Waterloo

 At SODA'10, Agarwal and Sharathkumar presented a streaming algorithm for approximating the minimum enclosing ball of a set of points in d-dimensional Euclidean space. Their… (more)

Subjects/Keywords: computational-geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pathak, V. (2011). Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6172

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

Pathak, Vinayak. “Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions.” 2011. Thesis, University of Waterloo. Accessed April 05, 2020. http://hdl.handle.net/10012/6172.

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

MLA Handbook (7th Edition):

Pathak, Vinayak. “Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions.” 2011. Web. 05 Apr 2020.

Vancouver:

Pathak V. Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/10012/6172.

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

Council of Science Editors:

Pathak V. Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6172

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


University of Illinois – Chicago

2. Sommars, Jeffrey C. Algorithms and Implementations in Computational Algebraic Geometry.

Degree: 2018, University of Illinois – Chicago

 In this thesis, we explore several areas of computational algebraic geometry, and develop new algorithms and software in each. We are generally interested in solving… (more)

Subjects/Keywords: Tropical geometry; computational algebraic geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sommars, J. C. (2018). Algorithms and Implementations in Computational Algebraic Geometry. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22687

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

Sommars, Jeffrey C. “Algorithms and Implementations in Computational Algebraic Geometry.” 2018. Thesis, University of Illinois – Chicago. Accessed April 05, 2020. http://hdl.handle.net/10027/22687.

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

MLA Handbook (7th Edition):

Sommars, Jeffrey C. “Algorithms and Implementations in Computational Algebraic Geometry.” 2018. Web. 05 Apr 2020.

Vancouver:

Sommars JC. Algorithms and Implementations in Computational Algebraic Geometry. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/10027/22687.

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

Council of Science Editors:

Sommars JC. Algorithms and Implementations in Computational Algebraic Geometry. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22687

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


Rutgers University

3. Shabbir, Mudassir. Some results in computational and combinatorial geometry.

Degree: PhD, Computer Science, 2014, Rutgers University

In this thesis we present some new results in the field of discrete and computational geometry. The techniques and tools developed to achieve these results… (more)

Subjects/Keywords: Discrete geometry; Computational geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shabbir, M. (2014). Some results in computational and combinatorial geometry. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/45458/

Chicago Manual of Style (16th Edition):

Shabbir, Mudassir. “Some results in computational and combinatorial geometry.” 2014. Doctoral Dissertation, Rutgers University. Accessed April 05, 2020. https://rucore.libraries.rutgers.edu/rutgers-lib/45458/.

MLA Handbook (7th Edition):

Shabbir, Mudassir. “Some results in computational and combinatorial geometry.” 2014. Web. 05 Apr 2020.

Vancouver:

Shabbir M. Some results in computational and combinatorial geometry. [Internet] [Doctoral dissertation]. Rutgers University; 2014. [cited 2020 Apr 05]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/45458/.

Council of Science Editors:

Shabbir M. Some results in computational and combinatorial geometry. [Doctoral Dissertation]. Rutgers University; 2014. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/45458/


Texas A&M University

4. Ghosh, Mukulika. Fast Approximate Convex Decomposition.

Degree: 2012, Texas A&M University

 Approximate convex decomposition (ACD) is a technique that partitions an input object into "approximately convex" components. Decomposition into approximately convex pieces is both more efficient… (more)

Subjects/Keywords: Convex Decomposition; Computational Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ghosh, M. (2012). Fast Approximate Convex Decomposition. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873

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

Ghosh, Mukulika. “Fast Approximate Convex Decomposition.” 2012. Thesis, Texas A&M University. Accessed April 05, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873.

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

MLA Handbook (7th Edition):

Ghosh, Mukulika. “Fast Approximate Convex Decomposition.” 2012. Web. 05 Apr 2020.

Vancouver:

Ghosh M. Fast Approximate Convex Decomposition. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873.

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

Council of Science Editors:

Ghosh M. Fast Approximate Convex Decomposition. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873

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


Universiteit Utrecht

5. Duijn, I. van. Pattern extraction in trajectories and its use in enriching visualisations.

Degree: 2014, Universiteit Utrecht

 Nowadays location aware devices are commonplace and produce large amounts of trajectories of moving objects like humans, cars, etc. To analyse this data there is… (more)

Subjects/Keywords: trajectory; visualisation; computational geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duijn, I. v. (2014). Pattern extraction in trajectories and its use in enriching visualisations. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/294075

Chicago Manual of Style (16th Edition):

Duijn, I van. “Pattern extraction in trajectories and its use in enriching visualisations.” 2014. Masters Thesis, Universiteit Utrecht. Accessed April 05, 2020. http://dspace.library.uu.nl:8080/handle/1874/294075.

MLA Handbook (7th Edition):

Duijn, I van. “Pattern extraction in trajectories and its use in enriching visualisations.” 2014. Web. 05 Apr 2020.

Vancouver:

Duijn Iv. Pattern extraction in trajectories and its use in enriching visualisations. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2020 Apr 05]. Available from: http://dspace.library.uu.nl:8080/handle/1874/294075.

Council of Science Editors:

Duijn Iv. Pattern extraction in trajectories and its use in enriching visualisations. [Masters Thesis]. Universiteit Utrecht; 2014. Available from: http://dspace.library.uu.nl:8080/handle/1874/294075


University of Notre Dame

6. Ewa Misiolek. Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>.

Degree: PhD, Computer Science and Engineering, 2011, University of Notre Dame

  Computer-aided manufacturing (CAM) is an area of manufacturing where computer algorithms are used for planning and controlling fabrication processes of three dimensional objects. Most… (more)

Subjects/Keywords: algorithm design; computational geometry; computer-aided manufacturing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Misiolek, E. (2011). Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/7m01bk14753

Chicago Manual of Style (16th Edition):

Misiolek, Ewa. “Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>.” 2011. Doctoral Dissertation, University of Notre Dame. Accessed April 05, 2020. https://curate.nd.edu/show/7m01bk14753.

MLA Handbook (7th Edition):

Misiolek, Ewa. “Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>.” 2011. Web. 05 Apr 2020.

Vancouver:

Misiolek E. Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2011. [cited 2020 Apr 05]. Available from: https://curate.nd.edu/show/7m01bk14753.

Council of Science Editors:

Misiolek E. Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>. [Doctoral Dissertation]. University of Notre Dame; 2011. Available from: https://curate.nd.edu/show/7m01bk14753


University of Waterloo

7. Bahun, Stephen. Algorithms for Optimizing Search Schedules in a Polygon.

Degree: 2008, University of Waterloo

 In the area of motion planning, considerable work has been done on guarding problems, where "guards", modelled as points, must guard a polygonal space from… (more)

Subjects/Keywords: computational geometry; visibility

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bahun, S. (2008). Algorithms for Optimizing Search Schedules in a Polygon. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/3964

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

Bahun, Stephen. “Algorithms for Optimizing Search Schedules in a Polygon.” 2008. Thesis, University of Waterloo. Accessed April 05, 2020. http://hdl.handle.net/10012/3964.

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

MLA Handbook (7th Edition):

Bahun, Stephen. “Algorithms for Optimizing Search Schedules in a Polygon.” 2008. Web. 05 Apr 2020.

Vancouver:

Bahun S. Algorithms for Optimizing Search Schedules in a Polygon. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/10012/3964.

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

Council of Science Editors:

Bahun S. Algorithms for Optimizing Search Schedules in a Polygon. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/3964

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


Queens University

8. Nicholson, Myles. QChopper - Segmentation of Large Surface Meshes for 3D Printing .

Degree: Computing, 2016, Queens University

 3D printers are becoming an ever-cheaper way to prototype or reproduce objects. There are difficulties that arise when attempting to reproduce very large objects with… (more)

Subjects/Keywords: Mesh Segmentation; 3d Printing; Computational Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nicholson, M. (2016). QChopper - Segmentation of Large Surface Meshes for 3D Printing . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/14017

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

Nicholson, Myles. “QChopper - Segmentation of Large Surface Meshes for 3D Printing .” 2016. Thesis, Queens University. Accessed April 05, 2020. http://hdl.handle.net/1974/14017.

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

MLA Handbook (7th Edition):

Nicholson, Myles. “QChopper - Segmentation of Large Surface Meshes for 3D Printing .” 2016. Web. 05 Apr 2020.

Vancouver:

Nicholson M. QChopper - Segmentation of Large Surface Meshes for 3D Printing . [Internet] [Thesis]. Queens University; 2016. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/1974/14017.

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

Council of Science Editors:

Nicholson M. QChopper - Segmentation of Large Surface Meshes for 3D Printing . [Thesis]. Queens University; 2016. Available from: http://hdl.handle.net/1974/14017

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

9. Meikle, Laura Isabel. Intuition in formal proof : a novel framework for combining mathematical tools.

Degree: PhD, 2014, University of Edinburgh

 This doctoral thesis addresses one major difficulty in formal proof: removing obstructions to intuition which hamper the proof endeavour. We investigate this in the context… (more)

Subjects/Keywords: 006.3; theorem proving; automated reasoning; computational geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meikle, L. I. (2014). Intuition in formal proof : a novel framework for combining mathematical tools. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/9663

Chicago Manual of Style (16th Edition):

Meikle, Laura Isabel. “Intuition in formal proof : a novel framework for combining mathematical tools.” 2014. Doctoral Dissertation, University of Edinburgh. Accessed April 05, 2020. http://hdl.handle.net/1842/9663.

MLA Handbook (7th Edition):

Meikle, Laura Isabel. “Intuition in formal proof : a novel framework for combining mathematical tools.” 2014. Web. 05 Apr 2020.

Vancouver:

Meikle LI. Intuition in formal proof : a novel framework for combining mathematical tools. [Internet] [Doctoral dissertation]. University of Edinburgh; 2014. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/1842/9663.

Council of Science Editors:

Meikle LI. Intuition in formal proof : a novel framework for combining mathematical tools. [Doctoral Dissertation]. University of Edinburgh; 2014. Available from: http://hdl.handle.net/1842/9663


University of Illinois – Urbana-Champaign

10. Raichel, Benjamin A. In pursuit of linear complexity in discrete and computational geometry.

Degree: PhD, Computer Science, 2015, University of Illinois – Urbana-Champaign

 Many computational problems arise naturally from geometric data. In this thesis, we consider three such problems: (i) distance optimization problems over point sets, (ii) computing… (more)

Subjects/Keywords: Computational Geometry; Discrete Geometry; Computational Topology; Geometric Optimization; Contour Trees; Voronoi Diagrams

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Raichel, B. A. (2015). In pursuit of linear complexity in discrete and computational geometry. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/88048

Chicago Manual of Style (16th Edition):

Raichel, Benjamin A. “In pursuit of linear complexity in discrete and computational geometry.” 2015. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed April 05, 2020. http://hdl.handle.net/2142/88048.

MLA Handbook (7th Edition):

Raichel, Benjamin A. “In pursuit of linear complexity in discrete and computational geometry.” 2015. Web. 05 Apr 2020.

Vancouver:

Raichel BA. In pursuit of linear complexity in discrete and computational geometry. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/2142/88048.

Council of Science Editors:

Raichel BA. In pursuit of linear complexity in discrete and computational geometry. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/88048

11. Boyer, Kirk Anthony. Barrier Graphs and Extremal Questions on Line, Ray, Segment, and Hyperplane Sensor Networks.

Degree: PhD, Mathematics, 2019, U of Denver

  A sensor network is typically modeled as a collection of spatially distributed objects with the same shape, generally for the purpose of surveilling or… (more)

Subjects/Keywords: Computational geometry; Extremal problems; Sensor networks; Geometry and Topology; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boyer, K. A. (2019). Barrier Graphs and Extremal Questions on Line, Ray, Segment, and Hyperplane Sensor Networks. (Doctoral Dissertation). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1555

Chicago Manual of Style (16th Edition):

Boyer, Kirk Anthony. “Barrier Graphs and Extremal Questions on Line, Ray, Segment, and Hyperplane Sensor Networks.” 2019. Doctoral Dissertation, U of Denver. Accessed April 05, 2020. https://digitalcommons.du.edu/etd/1555.

MLA Handbook (7th Edition):

Boyer, Kirk Anthony. “Barrier Graphs and Extremal Questions on Line, Ray, Segment, and Hyperplane Sensor Networks.” 2019. Web. 05 Apr 2020.

Vancouver:

Boyer KA. Barrier Graphs and Extremal Questions on Line, Ray, Segment, and Hyperplane Sensor Networks. [Internet] [Doctoral dissertation]. U of Denver; 2019. [cited 2020 Apr 05]. Available from: https://digitalcommons.du.edu/etd/1555.

Council of Science Editors:

Boyer KA. Barrier Graphs and Extremal Questions on Line, Ray, Segment, and Hyperplane Sensor Networks. [Doctoral Dissertation]. U of Denver; 2019. Available from: https://digitalcommons.du.edu/etd/1555


University of Pennsylvania

12. Watterson, Michael Fiore. Geometric Methods For The Planning, Control, And Estimation Of Free-Flying Autonomous Systems.

Degree: 2018, University of Pennsylvania

 Autonomous aerial robots navigating in uncertain environments have a wide variety of applications, including inspection, search and rescue, inventory localization, sports photography, entertainment, package delivery,… (more)

Subjects/Keywords: Computational Geometry; Differential Geometry; Quadrotors; Space Robotics; Trajectory Optimization; Robotics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watterson, M. F. (2018). Geometric Methods For The Planning, Control, And Estimation Of Free-Flying Autonomous Systems. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/3199

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

Watterson, Michael Fiore. “Geometric Methods For The Planning, Control, And Estimation Of Free-Flying Autonomous Systems.” 2018. Thesis, University of Pennsylvania. Accessed April 05, 2020. https://repository.upenn.edu/edissertations/3199.

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

MLA Handbook (7th Edition):

Watterson, Michael Fiore. “Geometric Methods For The Planning, Control, And Estimation Of Free-Flying Autonomous Systems.” 2018. Web. 05 Apr 2020.

Vancouver:

Watterson MF. Geometric Methods For The Planning, Control, And Estimation Of Free-Flying Autonomous Systems. [Internet] [Thesis]. University of Pennsylvania; 2018. [cited 2020 Apr 05]. Available from: https://repository.upenn.edu/edissertations/3199.

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

Council of Science Editors:

Watterson MF. Geometric Methods For The Planning, Control, And Estimation Of Free-Flying Autonomous Systems. [Thesis]. University of Pennsylvania; 2018. Available from: https://repository.upenn.edu/edissertations/3199

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


University of Florida

13. Accisano, Paul W. Template Matching with the Frechet Distance Metric.

Degree: PhD, Computer Engineering - Computer and Information Science and Engineering, 2015, University of Florida

 In this dissertation, we explore the general idea of reconstructing data according to a template, using the popular Frechet distance metric to grade the similarity… (more)

Subjects/Keywords: Algorithms; Approximation; Computational geometry; Cylinders; Distance functions; Dogs; Polygons; Polynomials; Vertices; Walking; geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Accisano, P. W. (2015). Template Matching with the Frechet Distance Metric. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0047479

Chicago Manual of Style (16th Edition):

Accisano, Paul W. “Template Matching with the Frechet Distance Metric.” 2015. Doctoral Dissertation, University of Florida. Accessed April 05, 2020. http://ufdc.ufl.edu/UFE0047479.

MLA Handbook (7th Edition):

Accisano, Paul W. “Template Matching with the Frechet Distance Metric.” 2015. Web. 05 Apr 2020.

Vancouver:

Accisano PW. Template Matching with the Frechet Distance Metric. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2020 Apr 05]. Available from: http://ufdc.ufl.edu/UFE0047479.

Council of Science Editors:

Accisano PW. Template Matching with the Frechet Distance Metric. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0047479


University of Oxford

14. Vonk, Jan Bert. The Atkin operator on spaces of overconvergent modular forms and arithmetic applications.

Degree: PhD, 2015, University of Oxford

 We investigate the action of the Atkin operator on spaces of overconvergent p-adic modular forms. Our contributions are both computational and geometric. We present several… (more)

Subjects/Keywords: 515; Algebraic geometry; Number theory; Modular forms; Hecke operators; p-adic geometry; computational number theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vonk, J. B. (2015). The Atkin operator on spaces of overconvergent modular forms and arithmetic applications. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:081e4e46-80c1-41e7-9154-3181ccb36313 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655130

Chicago Manual of Style (16th Edition):

Vonk, Jan Bert. “The Atkin operator on spaces of overconvergent modular forms and arithmetic applications.” 2015. Doctoral Dissertation, University of Oxford. Accessed April 05, 2020. http://ora.ox.ac.uk/objects/uuid:081e4e46-80c1-41e7-9154-3181ccb36313 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655130.

MLA Handbook (7th Edition):

Vonk, Jan Bert. “The Atkin operator on spaces of overconvergent modular forms and arithmetic applications.” 2015. Web. 05 Apr 2020.

Vancouver:

Vonk JB. The Atkin operator on spaces of overconvergent modular forms and arithmetic applications. [Internet] [Doctoral dissertation]. University of Oxford; 2015. [cited 2020 Apr 05]. Available from: http://ora.ox.ac.uk/objects/uuid:081e4e46-80c1-41e7-9154-3181ccb36313 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655130.

Council of Science Editors:

Vonk JB. The Atkin operator on spaces of overconvergent modular forms and arithmetic applications. [Doctoral Dissertation]. University of Oxford; 2015. Available from: http://ora.ox.ac.uk/objects/uuid:081e4e46-80c1-41e7-9154-3181ccb36313 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.655130


University of Illinois – Chicago

15. Bliss, Nathan R. Computing Series Expansions of Algebraic Space Curves.

Degree: 2018, University of Illinois – Chicago

 We work towards a series-based computational approach for polynomial systems having positive-dimensional solution sets. The tropical variety gives information on the exponents of the leading… (more)

Subjects/Keywords: computational algebraic geometry; puiseux series; gauss-newton algorithm; tropical geometry; polynomial systems; homotopy continuation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bliss, N. R. (2018). Computing Series Expansions of Algebraic Space Curves. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/22682

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

Bliss, Nathan R. “Computing Series Expansions of Algebraic Space Curves.” 2018. Thesis, University of Illinois – Chicago. Accessed April 05, 2020. http://hdl.handle.net/10027/22682.

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

MLA Handbook (7th Edition):

Bliss, Nathan R. “Computing Series Expansions of Algebraic Space Curves.” 2018. Web. 05 Apr 2020.

Vancouver:

Bliss NR. Computing Series Expansions of Algebraic Space Curves. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/10027/22682.

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

Council of Science Editors:

Bliss NR. Computing Series Expansions of Algebraic Space Curves. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/22682

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


University of Windsor

16. Panigrahi, Satish Chandra. GEOMETRIC OPTIMIZATION IN SOME PROXIMITY AND BIOINFORMATICS PROBLEMS.

Degree: PhD, Computer Science, 2014, University of Windsor

  The theme of this dissertation is geometric optimization and its applications. We study geometric proximity problems and several bioinformatics problems with a geometric content,… (more)

Subjects/Keywords: Computational geometry; Geometric proximity; Linear programming; Protein structure alignment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Panigrahi, S. C. (2014). GEOMETRIC OPTIMIZATION IN SOME PROXIMITY AND BIOINFORMATICS PROBLEMS. (Doctoral Dissertation). University of Windsor. Retrieved from http://scholar.uwindsor.ca/etd/5198

Chicago Manual of Style (16th Edition):

Panigrahi, Satish Chandra. “GEOMETRIC OPTIMIZATION IN SOME PROXIMITY AND BIOINFORMATICS PROBLEMS.” 2014. Doctoral Dissertation, University of Windsor. Accessed April 05, 2020. http://scholar.uwindsor.ca/etd/5198.

MLA Handbook (7th Edition):

Panigrahi, Satish Chandra. “GEOMETRIC OPTIMIZATION IN SOME PROXIMITY AND BIOINFORMATICS PROBLEMS.” 2014. Web. 05 Apr 2020.

Vancouver:

Panigrahi SC. GEOMETRIC OPTIMIZATION IN SOME PROXIMITY AND BIOINFORMATICS PROBLEMS. [Internet] [Doctoral dissertation]. University of Windsor; 2014. [cited 2020 Apr 05]. Available from: http://scholar.uwindsor.ca/etd/5198.

Council of Science Editors:

Panigrahi SC. GEOMETRIC OPTIMIZATION IN SOME PROXIMITY AND BIOINFORMATICS PROBLEMS. [Doctoral Dissertation]. University of Windsor; 2014. Available from: http://scholar.uwindsor.ca/etd/5198


Texas A&M University

17. Li, Wei. A New Design Method Framework for Open Origami Design Problems.

Degree: 2014, Texas A&M University

 With the development of computer science and manufacturing techniques, modern origami is no longer just used for making artistic shapes as its traditional counterpart was… (more)

Subjects/Keywords: Origami; Genetic algorithm; Origami engineering; Optimization; Computational geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, W. (2014). A New Design Method Framework for Open Origami Design Problems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/153468

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, Wei. “A New Design Method Framework for Open Origami Design Problems.” 2014. Thesis, Texas A&M University. Accessed April 05, 2020. http://hdl.handle.net/1969.1/153468.

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

MLA Handbook (7th Edition):

Li, Wei. “A New Design Method Framework for Open Origami Design Problems.” 2014. Web. 05 Apr 2020.

Vancouver:

Li W. A New Design Method Framework for Open Origami Design Problems. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/1969.1/153468.

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

Council of Science Editors:

Li W. A New Design Method Framework for Open Origami Design Problems. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/153468

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


Rochester Institute of Technology

18. Huseynov, Javid. Embeddability of pseudoline arrangements and point configurations to Eucliean plane.

Degree: Computer Science (GCCIS), 1999, Rochester Institute of Technology

 The present thesis explores embeddability (realizability) properties of pseudoline arrangements, perhaps, the most important mathematical structures in computational geometry. The underlying theme is the use… (more)

Subjects/Keywords: Computational geometry; Computer science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huseynov, J. (1999). Embeddability of pseudoline arrangements and point configurations to Eucliean plane. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/656

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

Huseynov, Javid. “Embeddability of pseudoline arrangements and point configurations to Eucliean plane.” 1999. Thesis, Rochester Institute of Technology. Accessed April 05, 2020. https://scholarworks.rit.edu/theses/656.

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

MLA Handbook (7th Edition):

Huseynov, Javid. “Embeddability of pseudoline arrangements and point configurations to Eucliean plane.” 1999. Web. 05 Apr 2020.

Vancouver:

Huseynov J. Embeddability of pseudoline arrangements and point configurations to Eucliean plane. [Internet] [Thesis]. Rochester Institute of Technology; 1999. [cited 2020 Apr 05]. Available from: https://scholarworks.rit.edu/theses/656.

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

Council of Science Editors:

Huseynov J. Embeddability of pseudoline arrangements and point configurations to Eucliean plane. [Thesis]. Rochester Institute of Technology; 1999. Available from: https://scholarworks.rit.edu/theses/656

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


Universiteit Utrecht

19. Rijnbeek, T.P.M. Continuous Voronoi Games on Graphs with Multiple Opponents.

Degree: 2015, Universiteit Utrecht

 In this thesis, we study the puzzle game Lines—a commercial game developed by Gamious—which is a variant of the one-round Voronoi game on graphs. The… (more)

Subjects/Keywords: Voronoi game; Voronoi diagram; Facility location; Lines; Graph theory; Computational geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rijnbeek, T. P. M. (2015). Continuous Voronoi Games on Graphs with Multiple Opponents. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/317774

Chicago Manual of Style (16th Edition):

Rijnbeek, T P M. “Continuous Voronoi Games on Graphs with Multiple Opponents.” 2015. Masters Thesis, Universiteit Utrecht. Accessed April 05, 2020. http://dspace.library.uu.nl:8080/handle/1874/317774.

MLA Handbook (7th Edition):

Rijnbeek, T P M. “Continuous Voronoi Games on Graphs with Multiple Opponents.” 2015. Web. 05 Apr 2020.

Vancouver:

Rijnbeek TPM. Continuous Voronoi Games on Graphs with Multiple Opponents. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Apr 05]. Available from: http://dspace.library.uu.nl:8080/handle/1874/317774.

Council of Science Editors:

Rijnbeek TPM. Continuous Voronoi Games on Graphs with Multiple Opponents. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/317774


Universiteit Utrecht

20. Driel, M.G. Real time intersections on Space Scale Cube data.

Degree: 2015, Universiteit Utrecht

 The space scale cube (SSC) model offers a new way of encoding 2D geographic data with continuous level of abstraction on the Z axis. Displaying… (more)

Subjects/Keywords: Geographic information systems; Graphics; Computational Geometry; Map visualization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Driel, M. G. (2015). Real time intersections on Space Scale Cube data. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/317777

Chicago Manual of Style (16th Edition):

Driel, M G. “Real time intersections on Space Scale Cube data.” 2015. Masters Thesis, Universiteit Utrecht. Accessed April 05, 2020. http://dspace.library.uu.nl:8080/handle/1874/317777.

MLA Handbook (7th Edition):

Driel, M G. “Real time intersections on Space Scale Cube data.” 2015. Web. 05 Apr 2020.

Vancouver:

Driel MG. Real time intersections on Space Scale Cube data. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Apr 05]. Available from: http://dspace.library.uu.nl:8080/handle/1874/317777.

Council of Science Editors:

Driel MG. Real time intersections on Space Scale Cube data. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/317777


Johannes Gutenberg Universität Mainz

21. 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 April 05, 2020. 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. 05 Apr 2020.

Vancouver:

Hemmer M. Exact computation of the adjacency graph of an arrangement of quadrics. [Internet] [Doctoral dissertation]. Johannes Gutenberg Universität Mainz; 2008. [cited 2020 Apr 05]. 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/


University of California – Merced

22. Liu, Shuo. Bridging the Gap in Grasp Quality Evaluation and Grasp Planning.

Degree: Electrical Engineering and Computer Science, 2017, University of California – Merced

 Robot grasp planning has been extensively studied in the last decades often consisting of two different stages determining where to grasp an object and measuring… (more)

Subjects/Keywords: Robotics; Computer science; Computational Geometry; Grasp Planning; Grasp Quality Evaluation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, S. (2017). Bridging the Gap in Grasp Quality Evaluation and Grasp Planning. (Thesis). University of California – Merced. Retrieved from http://www.escholarship.org/uc/item/36b870j6

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

Liu, Shuo. “Bridging the Gap in Grasp Quality Evaluation and Grasp Planning.” 2017. Thesis, University of California – Merced. Accessed April 05, 2020. http://www.escholarship.org/uc/item/36b870j6.

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

MLA Handbook (7th Edition):

Liu, Shuo. “Bridging the Gap in Grasp Quality Evaluation and Grasp Planning.” 2017. Web. 05 Apr 2020.

Vancouver:

Liu S. Bridging the Gap in Grasp Quality Evaluation and Grasp Planning. [Internet] [Thesis]. University of California – Merced; 2017. [cited 2020 Apr 05]. Available from: http://www.escholarship.org/uc/item/36b870j6.

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

Council of Science Editors:

Liu S. Bridging the Gap in Grasp Quality Evaluation and Grasp Planning. [Thesis]. University of California – Merced; 2017. Available from: http://www.escholarship.org/uc/item/36b870j6

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

23. Cardoso, Pedro J. S. Ant colony algorithms for multiple objective combinatorial optimization: applications to the minimum spanning trees problems.

Degree: 2010, RCAAP

 The study of meta-heuristic solutions based on the Ant Colony Optimization (ACO) paradigm for the Multiple Objective Minimum Spanning Trees and related combinatorial problems is… (more)

Subjects/Keywords: Swarm Intelligence, Multiobjective optimization, Computational Geometry; Investigação operacional

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cardoso, P. J. S. (2010). Ant colony algorithms for multiple objective combinatorial optimization: applications to the minimum spanning trees problems. (Thesis). RCAAP. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/203

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

Cardoso, Pedro J S. “Ant colony algorithms for multiple objective combinatorial optimization: applications to the minimum spanning trees problems.” 2010. Thesis, RCAAP. Accessed April 05, 2020. http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/203.

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

MLA Handbook (7th Edition):

Cardoso, Pedro J S. “Ant colony algorithms for multiple objective combinatorial optimization: applications to the minimum spanning trees problems.” 2010. Web. 05 Apr 2020.

Vancouver:

Cardoso PJS. Ant colony algorithms for multiple objective combinatorial optimization: applications to the minimum spanning trees problems. [Internet] [Thesis]. RCAAP; 2010. [cited 2020 Apr 05]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/203.

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

Council of Science Editors:

Cardoso PJS. Ant colony algorithms for multiple objective combinatorial optimization: applications to the minimum spanning trees problems. [Thesis]. RCAAP; 2010. Available from: http://www.rcaap.pt/detail.jsp?id=oai:sapientia.ualg.pt:10400.1/203

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

24. Nave Jr, Gary Kirk. Nonlinear Models and Geometric Structure of Fluid Forcing on Moving Bodies.

Degree: PhD, Engineering Science and Mechanics, 2018, Virginia Tech

 This dissertation presents useful nonlinear models for fluid forcing on a moving body in two distinct contexts, and methods for analyzing the geometric structure within… (more)

Subjects/Keywords: Fluid-structure interaction; phase space structure; computational geometry; nonlinear dynamics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nave Jr, G. K. (2018). Nonlinear Models and Geometric Structure of Fluid Forcing on Moving Bodies. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/84945

Chicago Manual of Style (16th Edition):

Nave Jr, Gary Kirk. “Nonlinear Models and Geometric Structure of Fluid Forcing on Moving Bodies.” 2018. Doctoral Dissertation, Virginia Tech. Accessed April 05, 2020. http://hdl.handle.net/10919/84945.

MLA Handbook (7th Edition):

Nave Jr, Gary Kirk. “Nonlinear Models and Geometric Structure of Fluid Forcing on Moving Bodies.” 2018. Web. 05 Apr 2020.

Vancouver:

Nave Jr GK. Nonlinear Models and Geometric Structure of Fluid Forcing on Moving Bodies. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/10919/84945.

Council of Science Editors:

Nave Jr GK. Nonlinear Models and Geometric Structure of Fluid Forcing on Moving Bodies. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/84945


Utah State University

25. Zhang, Jingru. Geometric Facility Location Problems on Uncertain Data.

Degree: PhD, Computer Science, 2017, Utah State University

  Facility location, as an important topic in computer science and operations research, is concerned with placing facilities for "serving" demand points (each representing a… (more)

Subjects/Keywords: Algorithms; computational geometry; facility location; k-center; uncertain data; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, J. (2017). Geometric Facility Location Problems on Uncertain Data. (Doctoral Dissertation). Utah State University. Retrieved from https://digitalcommons.usu.edu/etd/6337

Chicago Manual of Style (16th Edition):

Zhang, Jingru. “Geometric Facility Location Problems on Uncertain Data.” 2017. Doctoral Dissertation, Utah State University. Accessed April 05, 2020. https://digitalcommons.usu.edu/etd/6337.

MLA Handbook (7th Edition):

Zhang, Jingru. “Geometric Facility Location Problems on Uncertain Data.” 2017. Web. 05 Apr 2020.

Vancouver:

Zhang J. Geometric Facility Location Problems on Uncertain Data. [Internet] [Doctoral dissertation]. Utah State University; 2017. [cited 2020 Apr 05]. Available from: https://digitalcommons.usu.edu/etd/6337.

Council of Science Editors:

Zhang J. Geometric Facility Location Problems on Uncertain Data. [Doctoral Dissertation]. Utah State University; 2017. Available from: https://digitalcommons.usu.edu/etd/6337

26. Hosseini Alamdari, Soroush. Planar Open Rectangle-of-Influence Drawings.

Degree: 2012, University of Waterloo

 A straight line drawing of a graph is an open weak rectangle-of-influence (RI) drawing, if there is no vertex in the relative interior of the… (more)

Subjects/Keywords: Computational Geometry; Graph Drawing

computational geometry, pattern recognition, computational morphology, numerical analysis… …computational biology, and GIS (e.g. see Chapter “Graph drawing” of [17]). One of… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hosseini Alamdari, S. (2012). Planar Open Rectangle-of-Influence Drawings. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6750

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

Hosseini Alamdari, Soroush. “Planar Open Rectangle-of-Influence Drawings.” 2012. Thesis, University of Waterloo. Accessed April 05, 2020. http://hdl.handle.net/10012/6750.

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

MLA Handbook (7th Edition):

Hosseini Alamdari, Soroush. “Planar Open Rectangle-of-Influence Drawings.” 2012. Web. 05 Apr 2020.

Vancouver:

Hosseini Alamdari S. Planar Open Rectangle-of-Influence Drawings. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/10012/6750.

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

Council of Science Editors:

Hosseini Alamdari S. Planar Open Rectangle-of-Influence Drawings. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6750

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


University of Waterloo

27. Pratt, Simon. Three Approaches to Building Time-Windowed Geometric Data Structures.

Degree: 2016, University of Waterloo

 Given a set of geometric objects (points or line segments) each associated with a time value, we wish to determine whether a given property is… (more)

Subjects/Keywords: computational geometry; geometric data structures; data structures; algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pratt, S. (2016). Three Approaches to Building Time-Windowed Geometric Data Structures. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10654

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

Pratt, Simon. “Three Approaches to Building Time-Windowed Geometric Data Structures.” 2016. Thesis, University of Waterloo. Accessed April 05, 2020. http://hdl.handle.net/10012/10654.

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

MLA Handbook (7th Edition):

Pratt, Simon. “Three Approaches to Building Time-Windowed Geometric Data Structures.” 2016. Web. 05 Apr 2020.

Vancouver:

Pratt S. Three Approaches to Building Time-Windowed Geometric Data Structures. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/10012/10654.

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

Council of Science Editors:

Pratt S. Three Approaches to Building Time-Windowed Geometric Data Structures. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10654

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


University of Toronto

28. Telidetzki, Karla. Application of Jetstream to a Suite of Aerodynamic Shape Optimization Problems.

Degree: 2014, University of Toronto

The impact of dimensionality on three aerodynamic optimization cases is studied to determine the effect of the number of geometric design variables. The cases investigated… (more)

Subjects/Keywords: Aerodynamic design; Aerodynamic shape optimization; Computational fluid dynamics; Geometry parameterization; 0538

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Telidetzki, K. (2014). Application of Jetstream to a Suite of Aerodynamic Shape Optimization Problems. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/67967

Chicago Manual of Style (16th Edition):

Telidetzki, Karla. “Application of Jetstream to a Suite of Aerodynamic Shape Optimization Problems.” 2014. Masters Thesis, University of Toronto. Accessed April 05, 2020. http://hdl.handle.net/1807/67967.

MLA Handbook (7th Edition):

Telidetzki, Karla. “Application of Jetstream to a Suite of Aerodynamic Shape Optimization Problems.” 2014. Web. 05 Apr 2020.

Vancouver:

Telidetzki K. Application of Jetstream to a Suite of Aerodynamic Shape Optimization Problems. [Internet] [Masters thesis]. University of Toronto; 2014. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/1807/67967.

Council of Science Editors:

Telidetzki K. Application of Jetstream to a Suite of Aerodynamic Shape Optimization Problems. [Masters Thesis]. University of Toronto; 2014. Available from: http://hdl.handle.net/1807/67967


University of Waterloo

29. Afshani, Peyman. On Geometric Range Searching, Approximate Counting and Depth Problems.

Degree: 2008, University of Waterloo

 In this thesis we deal with problems connected to range searching, which is one of the central areas of computational geometry. The dominant problems in… (more)

Subjects/Keywords: computational geometry; range searching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Afshani, P. (2008). On Geometric Range Searching, Approximate Counting and Depth Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4032

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

Afshani, Peyman. “On Geometric Range Searching, Approximate Counting and Depth Problems.” 2008. Thesis, University of Waterloo. Accessed April 05, 2020. http://hdl.handle.net/10012/4032.

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

MLA Handbook (7th Edition):

Afshani, Peyman. “On Geometric Range Searching, Approximate Counting and Depth Problems.” 2008. Web. 05 Apr 2020.

Vancouver:

Afshani P. On Geometric Range Searching, Approximate Counting and Depth Problems. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/10012/4032.

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

Council of Science Editors:

Afshani P. On Geometric Range Searching, Approximate Counting and Depth Problems. [Thesis]. University of Waterloo; 2008. Available from: http://hdl.handle.net/10012/4032

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


University of Waterloo

30. Chen, Yu. Solving Geometric Problems in Space-Conscious Models.

Degree: 2009, University of Waterloo

 When dealing with massive data sets, standard algorithms may easily ``run out of memory''. In this thesis, we design efficient algorithms in space-conscious models. In… (more)

Subjects/Keywords: Algorithms; Data Structures; Computational Geometry

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Y. (2009). Solving Geometric Problems in Space-Conscious Models. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4257

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, Yu. “Solving Geometric Problems in Space-Conscious Models.” 2009. Thesis, University of Waterloo. Accessed April 05, 2020. http://hdl.handle.net/10012/4257.

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

MLA Handbook (7th Edition):

Chen, Yu. “Solving Geometric Problems in Space-Conscious Models.” 2009. Web. 05 Apr 2020.

Vancouver:

Chen Y. Solving Geometric Problems in Space-Conscious Models. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2020 Apr 05]. Available from: http://hdl.handle.net/10012/4257.

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

Council of Science Editors:

Chen Y. Solving Geometric Problems in Space-Conscious Models. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4257

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

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

.