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

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

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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Pathak V. Streaming and Dynamic Algorithms for Minimum Enclosing Balls in High Dimensions. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Jul 21]. 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


Texas A&M University

2. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Ghosh M. Fast Approximate Convex Decomposition. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2019 Jul 21]. 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

3. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Duijn Iv. Pattern extraction in trajectories and its use in enriching visualisations. [Internet] [Masters thesis]. Universiteit Utrecht; 2014. [cited 2019 Jul 21]. 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 Waterloo

4. Jain, Kshitij. Minimum Shared-Power Edge Cut.

Degree: 2018, University of Waterloo

 We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s… (more)

Subjects/Keywords: Algorithms; Computational Geometry; Approximation Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jain, K. (2018). Minimum Shared-Power Edge Cut. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13664

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

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Thesis, University of Waterloo. Accessed July 21, 2019. http://hdl.handle.net/10012/13664.

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

MLA Handbook (7th Edition):

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Web. 21 Jul 2019.

Vancouver:

Jain K. Minimum Shared-Power Edge Cut. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/10012/13664.

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

Council of Science Editors:

Jain K. Minimum Shared-Power Edge Cut. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13664

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


Queens University

5. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Nicholson M. QCHOPPER - SEGMENTATION OF LARGE SURFACE MESHES FOR 3D PRINTING . [Internet] [Thesis]. Queens University; 2016. [cited 2019 Jul 21]. 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


University of Waterloo

6. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Bahun S. Algorithms for Optimizing Search Schedules in a Polygon. [Internet] [Thesis]. University of Waterloo; 2008. [cited 2019 Jul 21]. 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


University of Notre Dame

7. 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 July 21, 2019. https://curate.nd.edu/show/7m01bk14753.

MLA Handbook (7th Edition):

Misiolek, Ewa. “Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>.” 2011. Web. 21 Jul 2019.

Vancouver:

Misiolek E. Efficient Algorithms for Geometric Problems in Computer-Aided Manufacturing</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2011. [cited 2019 Jul 21]. 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

8. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Meikle LI. Intuition in formal proof : a novel framework for combining mathematical tools. [Internet] [Doctoral dissertation]. University of Edinburgh; 2014. [cited 2019 Jul 21]. 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

9. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Raichel BA. In pursuit of linear complexity in discrete and computational geometry. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2015. [cited 2019 Jul 21]. 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


University of Pennsylvania

10. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Watterson MF. Geometric Methods For The Planning, Control, And Estimation Of Free-Flying Autonomous Systems. [Internet] [Thesis]. University of Pennsylvania; 2018. [cited 2019 Jul 21]. 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

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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Boyer KA. Barrier Graphs and Extremal Questions on Line, Ray, Segment, and Hyperplane Sensor Networks. [Internet] [Doctoral dissertation]. U of Denver; 2019. [cited 2019 Jul 21]. 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 Oxford

12. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Vonk JB. The Atkin operator on spaces of overconvergent modular forms and arithmetic applications. [Internet] [Doctoral dissertation]. University of Oxford; 2015. [cited 2019 Jul 21]. 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 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 July 21, 2019. http://ufdc.ufl.edu/UFE0047479.

MLA Handbook (7th Edition):

Accisano, Paul W. “Template Matching with the Frechet Distance Metric.” 2015. Web. 21 Jul 2019.

Vancouver:

Accisano PW. Template Matching with the Frechet Distance Metric. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2019 Jul 21]. 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 Helsinki

14. Talvitie, Topi. Geometric kth shortest paths.

Degree: Department of Mathematics and Statistics; Helsingfors universitet, Matematisk-naturvetenskapliga fakulteten, Institutionen för matematik och statistik, 2015, University of Helsinki

 Finding shortest paths in planar domains bounded by polygons is a well-studied problem in computational geometry. However, in many applications, only finding the shortest path… (more)

Subjects/Keywords: computational geometry; locally shortest paths; route planning; Applied Mathematics; Soveltava matematiikka; Tillämpad matematik; computational geometry; locally shortest paths; route planning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Talvitie, T. (2015). Geometric kth shortest paths. (Masters Thesis). University of Helsinki. Retrieved from http://hdl.handle.net/10138/158364

Chicago Manual of Style (16th Edition):

Talvitie, Topi. “Geometric kth shortest paths.” 2015. Masters Thesis, University of Helsinki. Accessed July 21, 2019. http://hdl.handle.net/10138/158364.

MLA Handbook (7th Edition):

Talvitie, Topi. “Geometric kth shortest paths.” 2015. Web. 21 Jul 2019.

Vancouver:

Talvitie T. Geometric kth shortest paths. [Internet] [Masters thesis]. University of Helsinki; 2015. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/10138/158364.

Council of Science Editors:

Talvitie T. Geometric kth shortest paths. [Masters Thesis]. University of Helsinki; 2015. Available from: http://hdl.handle.net/10138/158364


George Mason University

15. O'Neil, Patrick. Analyzing and Extending the Distance-to-Measure Gradient Flow Using Higher Order Voronoi Diagrams .

Degree: 2017, George Mason University

 Point cloud data arises naturally from 3D scanners, LiDAR sensors, and industrial computed tomography among other sources. Most point clouds obtained through experimental means exhibit… (more)

Subjects/Keywords: Mathematics; Computational Geometry; Computational Topology; Piecewise-Smooth Dynamical Systems; Point Clouds; Voronoi Diagrams

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

O'Neil, P. (2017). Analyzing and Extending the Distance-to-Measure Gradient Flow Using Higher Order Voronoi Diagrams . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/11241

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

O'Neil, Patrick. “Analyzing and Extending the Distance-to-Measure Gradient Flow Using Higher Order Voronoi Diagrams .” 2017. Thesis, George Mason University. Accessed July 21, 2019. http://hdl.handle.net/1920/11241.

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

MLA Handbook (7th Edition):

O'Neil, Patrick. “Analyzing and Extending the Distance-to-Measure Gradient Flow Using Higher Order Voronoi Diagrams .” 2017. Web. 21 Jul 2019.

Vancouver:

O'Neil P. Analyzing and Extending the Distance-to-Measure Gradient Flow Using Higher Order Voronoi Diagrams . [Internet] [Thesis]. George Mason University; 2017. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/1920/11241.

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

Council of Science Editors:

O'Neil P. Analyzing and Extending the Distance-to-Measure Gradient Flow Using Higher Order Voronoi Diagrams . [Thesis]. George Mason University; 2017. Available from: http://hdl.handle.net/1920/11241

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

16. Boyer, Kirk Anthony. On Barrier Graphs of Sensor Networks.

Degree: MS, Computer Science, 2017, U of Denver

  The study of sensor networks begins with a model, which usually has a geometric component. This thesis focuses on networks of sensors modeled as… (more)

Subjects/Keywords: Barrier; Computational geometry; Coverage; Sensor networks; Computer Sciences; Other Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Boyer, K. A. (2017). On Barrier Graphs of Sensor Networks. (Thesis). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1420

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

Boyer, Kirk Anthony. “On Barrier Graphs of Sensor Networks.” 2017. Thesis, U of Denver. Accessed July 21, 2019. https://digitalcommons.du.edu/etd/1420.

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

MLA Handbook (7th Edition):

Boyer, Kirk Anthony. “On Barrier Graphs of Sensor Networks.” 2017. Web. 21 Jul 2019.

Vancouver:

Boyer KA. On Barrier Graphs of Sensor Networks. [Internet] [Thesis]. U of Denver; 2017. [cited 2019 Jul 21]. Available from: https://digitalcommons.du.edu/etd/1420.

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

Council of Science Editors:

Boyer KA. On Barrier Graphs of Sensor Networks. [Thesis]. U of Denver; 2017. Available from: https://digitalcommons.du.edu/etd/1420

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


University of Windsor

17. 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 July 21, 2019. http://scholar.uwindsor.ca/etd/5198.

MLA Handbook (7th Edition):

Panigrahi, Satish Chandra. “GEOMETRIC OPTIMIZATION IN SOME PROXIMITY AND BIOINFORMATICS PROBLEMS.” 2014. Web. 21 Jul 2019.

Vancouver:

Panigrahi SC. GEOMETRIC OPTIMIZATION IN SOME PROXIMITY AND BIOINFORMATICS PROBLEMS. [Internet] [Doctoral dissertation]. University of Windsor; 2014. [cited 2019 Jul 21]. 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

18. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Li W. A New Design Method Framework for Open Origami Design Problems. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2019 Jul 21]. 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


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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Rijnbeek TPM. Continuous Voronoi Games on Graphs with Multiple Opponents. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Jul 21]. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Driel MG. Real time intersections on Space Scale Cube data. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Jul 21]. 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 July 21, 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. 21 Jul 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 Jul 21]. 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/


Georgia State University

22. Puri, Satish. Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing.

Degree: PhD, Computer Science, 2015, Georgia State University

  Polygon clipping is one of the complex operations in computational geometry. It is used in Geographic Information Systems (GIS), Computer Graphics, and VLSI CAD.… (more)

Subjects/Keywords: Polygon Clipping; Polygon Overlay; Computational Geometry; Parallel Algorithm; MPI; MapReduce

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Puri, S. (2015). Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing. (Doctoral Dissertation). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_diss/98

Chicago Manual of Style (16th Edition):

Puri, Satish. “Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing.” 2015. Doctoral Dissertation, Georgia State University. Accessed July 21, 2019. https://scholarworks.gsu.edu/cs_diss/98.

MLA Handbook (7th Edition):

Puri, Satish. “Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing.” 2015. Web. 21 Jul 2019.

Vancouver:

Puri S. Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing. [Internet] [Doctoral dissertation]. Georgia State University; 2015. [cited 2019 Jul 21]. Available from: https://scholarworks.gsu.edu/cs_diss/98.

Council of Science Editors:

Puri S. Efficient Parallel and Distributed Algorithms for GIS Polygon Overlay Processing. [Doctoral Dissertation]. Georgia State University; 2015. Available from: https://scholarworks.gsu.edu/cs_diss/98


University of California – Merced

23. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Liu S. Bridging the Gap in Grasp Quality Evaluation and Grasp Planning. [Internet] [Thesis]. University of California – Merced; 2017. [cited 2019 Jul 21]. 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

24. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Cardoso PJS. Ant colony algorithms for multiple objective combinatorial optimization: applications to the minimum spanning trees problems. [Internet] [Thesis]. RCAAP; 2010. [cited 2019 Jul 21]. 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


Duke University

25. Ganjugunte, Shashidhara Krishnamurthy. Geometric Hitting Sets and Their Variants .

Degree: 2011, Duke University

  This thesis explores a few geometric optimization problems that arise in robotics and sensor networks. In particular we present efficient algorithms for the hitting-set… (more)

Subjects/Keywords: Computer science; Computational Geometry; Hitting Set; Network vulnerability; Robotics; Sensor networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ganjugunte, S. K. (2011). Geometric Hitting Sets and Their Variants . (Thesis). Duke University. Retrieved from http://hdl.handle.net/10161/4972

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

Ganjugunte, Shashidhara Krishnamurthy. “Geometric Hitting Sets and Their Variants .” 2011. Thesis, Duke University. Accessed July 21, 2019. http://hdl.handle.net/10161/4972.

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

MLA Handbook (7th Edition):

Ganjugunte, Shashidhara Krishnamurthy. “Geometric Hitting Sets and Their Variants .” 2011. Web. 21 Jul 2019.

Vancouver:

Ganjugunte SK. Geometric Hitting Sets and Their Variants . [Internet] [Thesis]. Duke University; 2011. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/10161/4972.

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

Council of Science Editors:

Ganjugunte SK. Geometric Hitting Sets and Their Variants . [Thesis]. Duke University; 2011. Available from: http://hdl.handle.net/10161/4972

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


Queen Mary, University of London

26. Zhang, Xingchen. CAD-based geometry parametrisation for shape optimisation using non-uniform rational B-splines.

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

 With the continuous growth in computing power, numerical optimisation is increasingly applied in shape optimisation using Computational Fluid Dynamics (CFD). Since CFD computations are expensive,… (more)

Subjects/Keywords: Computational Fluid Dynamics; Geometry parametrisation; object design; engineering design

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, X. (2018). CAD-based geometry parametrisation for shape optimisation using non-uniform rational B-splines. (Doctoral Dissertation). Queen Mary, University of London. Retrieved from http://qmro.qmul.ac.uk/xmlui/handle/123456789/43186 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766194

Chicago Manual of Style (16th Edition):

Zhang, Xingchen. “CAD-based geometry parametrisation for shape optimisation using non-uniform rational B-splines.” 2018. Doctoral Dissertation, Queen Mary, University of London. Accessed July 21, 2019. http://qmro.qmul.ac.uk/xmlui/handle/123456789/43186 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766194.

MLA Handbook (7th Edition):

Zhang, Xingchen. “CAD-based geometry parametrisation for shape optimisation using non-uniform rational B-splines.” 2018. Web. 21 Jul 2019.

Vancouver:

Zhang X. CAD-based geometry parametrisation for shape optimisation using non-uniform rational B-splines. [Internet] [Doctoral dissertation]. Queen Mary, University of London; 2018. [cited 2019 Jul 21]. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/43186 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766194.

Council of Science Editors:

Zhang X. CAD-based geometry parametrisation for shape optimisation using non-uniform rational B-splines. [Doctoral Dissertation]. Queen Mary, University of London; 2018. Available from: http://qmro.qmul.ac.uk/xmlui/handle/123456789/43186 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.766194


Virginia Tech

27. 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 July 21, 2019. 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. 21 Jul 2019.

Vancouver:

Nave Jr GK. Nonlinear Models and Geometric Structure of Fluid Forcing on Moving Bodies. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2019 Jul 21]. 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


Queens University

28. Nunez Rodriguez, Yurai. Problems on Geometric Graphs with Applications to Wireless Networks .

Degree: Computing, 2009, Queens University

 It is hard to imagine the modern world without wireless communication. Wireless networks are, however, challenging inasmuch as they are useful. Because of their complexity,… (more)

Subjects/Keywords: Wireless Network; Geometric Graph; Computational Geometry; Algorithm; Distributed Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nunez Rodriguez, Y. (2009). Problems on Geometric Graphs with Applications to Wireless Networks . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/5335

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

Nunez Rodriguez, Yurai. “Problems on Geometric Graphs with Applications to Wireless Networks .” 2009. Thesis, Queens University. Accessed July 21, 2019. http://hdl.handle.net/1974/5335.

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

MLA Handbook (7th Edition):

Nunez Rodriguez, Yurai. “Problems on Geometric Graphs with Applications to Wireless Networks .” 2009. Web. 21 Jul 2019.

Vancouver:

Nunez Rodriguez Y. Problems on Geometric Graphs with Applications to Wireless Networks . [Internet] [Thesis]. Queens University; 2009. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/1974/5335.

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

Council of Science Editors:

Nunez Rodriguez Y. Problems on Geometric Graphs with Applications to Wireless Networks . [Thesis]. Queens University; 2009. Available from: http://hdl.handle.net/1974/5335

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


University of Miami

29. Masterjohn, Joseph. Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves.

Degree: MS, Computer Science (Arts and Sciences), 2017, University of Miami

  One of the fundamental concepts in computational geometry is deducing the combinatorial structure, or interactions, of a group of static geometric objects. In two… (more)

Subjects/Keywords: computational geometry; arrangements; algebraic curves; algorithms; intersections; polynomial systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Masterjohn, J. (2017). Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves. (Thesis). University of Miami. Retrieved from https://scholarlyrepository.miami.edu/oa_theses/699

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

Masterjohn, Joseph. “Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves.” 2017. Thesis, University of Miami. Accessed July 21, 2019. https://scholarlyrepository.miami.edu/oa_theses/699.

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

MLA Handbook (7th Edition):

Masterjohn, Joseph. “Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves.” 2017. Web. 21 Jul 2019.

Vancouver:

Masterjohn J. Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves. [Internet] [Thesis]. University of Miami; 2017. [cited 2019 Jul 21]. Available from: https://scholarlyrepository.miami.edu/oa_theses/699.

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

Council of Science Editors:

Masterjohn J. Encasement: A Robust Method for Finding Intersections of Semi-algebraic Curves. [Thesis]. University of Miami; 2017. Available from: https://scholarlyrepository.miami.edu/oa_theses/699

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


Utah State University

30. 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 July 21, 2019. https://digitalcommons.usu.edu/etd/6337.

MLA Handbook (7th Edition):

Zhang, Jingru. “Geometric Facility Location Problems on Uncertain Data.” 2017. Web. 21 Jul 2019.

Vancouver:

Zhang J. Geometric Facility Location Problems on Uncertain Data. [Internet] [Doctoral dissertation]. Utah State University; 2017. [cited 2019 Jul 21]. 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

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

.