Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Computational Geometry Generic Programming CGAL)`

.
Showing records 1 – 30 of
25669 total matches.

◁ [1] [2] [3] [4] [5] … [856] ▶

Search Limiters

Dates

- 2016 – 2020 (8285)
- 2011 – 2015 (9256)
- 2006 – 2010 (4890)
- 2001 – 2005 (1788)
- 1996 – 2000 (855)
- 1991 – 1995 (606)
- 1986 – 1990 (482)
- 1981 – 1985 (357)
- 1976 – 1980 (187)
- 1971 – 1975 (258)

Universities

- Brno University of Technology (944)
- ETH Zürich (637)
- University of Florida (611)
- Georgia Tech (495)
- University of São Paulo (457)
- Virginia Tech (428)
- Delft University of Technology (343)
- KTH (330)
- University of Waterloo (291)
- The Ohio State University (285)
- University of Toronto (281)
- University of Illinois – Urbana-Champaign (278)
- National University of Singapore (276)
- Pontifical Catholic University of Rio de Janeiro (275)
- Texas A&M University (275)

Department

- Computer Science (816)
- Mathematics (575)
- Mechanical Engineering (514)
- Informatique (315)
- Electrical and Computer Engineering (261)
- Chemistry (225)
- Industrial and Systems Engineering (222)
- Electrical Engineering (172)
- Aerospace Engineering (168)
- Physics (129)
- Mathématiques (113)
- Biomedical Engineering (105)
- Department of Computer Science (104)
- Computer Science and Engineering (103)
- Industrial Engineering (98)

Degrees

- PhD (5994)
- MS (2078)
- Docteur es (1196)
- Master (299)
- Mestrado (278)
- MA (184)
- MSc (65)
- MS(M.S.) (63)
- MSin Computer Science (56)
- MAin Mathematics (41)
- M.S (40)
- M. Arch. (37)
- MASc (37)
- MSin Engineering (37)
- EdD (28)

Levels

- doctoral (9535)
- masters (4267)
- thesis (434)
- project (60)
- doctor of philosophy ph.d. (51)
- doctor of philosophy (ph.d.) (33)
- 1 (31)

Languages

Country

- US (10011)
- Canada (1972)
- Brazil (1770)
- UK (1603)
- Sweden (1389)
- France (1196)
- Czech Republic (948)
- Australia (906)
- Netherlands (771)
- Greece (725)
- Switzerland (680)
- South Africa (498)
- India (412)
- Portugal (287)
- Spain (283)

▼ Search Limiters

Johannes Gutenberg Universität Mainz

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

Degree: 2008, Johannes Gutenberg Universität Mainz

URL: http://ubm.opus.hbz-nrw.de/volltexte/2008/1641/

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Hemmer, Michael. “Exact computation of the adjacency graph of an arrangement of quadrics.” 2008. Web. 14 Jul 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 Jul 14]. 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/

Université de Lorraine

2. Iordanov, Iordan. Delaunay triangulations of a family of symmetric hyperbolic surfaces in practice : Triangulations de Delaunay d'une famille de surfaces hyperboliques symétriques en pratique.

Degree: Docteur es, Informatique, 2019, Université de Lorraine

URL: http://www.theses.fr/2019LORR0010

► La surface de Bolza est la surface hyperbolique orientable compacte la plus symétrique de genre 2. Pour tout genre supérieur à 2, il existe une…
(more)

Subjects/Keywords: Triangulation de Delaunay; Géométrie hyperbolique; Groupes Fuchsiens; CGAL; Delaunay triangulations; Hyperbolic geometry; Fuchsian groups; CGAL; 005.1; 516.002 85

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Iordanov, I. (2019). Delaunay triangulations of a family of symmetric hyperbolic surfaces in practice : Triangulations de Delaunay d'une famille de surfaces hyperboliques symétriques en pratique. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2019LORR0010

Chicago Manual of Style (16^{th} Edition):

Iordanov, Iordan. “Delaunay triangulations of a family of symmetric hyperbolic surfaces in practice : Triangulations de Delaunay d'une famille de surfaces hyperboliques symétriques en pratique.” 2019. Doctoral Dissertation, Université de Lorraine. Accessed July 14, 2020. http://www.theses.fr/2019LORR0010.

MLA Handbook (7^{th} Edition):

Iordanov, Iordan. “Delaunay triangulations of a family of symmetric hyperbolic surfaces in practice : Triangulations de Delaunay d'une famille de surfaces hyperboliques symétriques en pratique.” 2019. Web. 14 Jul 2020.

Vancouver:

Iordanov I. Delaunay triangulations of a family of symmetric hyperbolic surfaces in practice : Triangulations de Delaunay d'une famille de surfaces hyperboliques symétriques en pratique. [Internet] [Doctoral dissertation]. Université de Lorraine; 2019. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2019LORR0010.

Council of Science Editors:

Iordanov I. Delaunay triangulations of a family of symmetric hyperbolic surfaces in practice : Triangulations de Delaunay d'une famille de surfaces hyperboliques symétriques en pratique. [Doctoral Dissertation]. Université de Lorraine; 2019. Available from: http://www.theses.fr/2019LORR0010

University of Windsor

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

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

URL: http://scholar.uwindsor.ca/etd/5198

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Freie Universität Berlin

4. Atariah, Dror. Parametrisierungen und Approximationen von Flächen im Konfigurationsraum.

Degree: 2014, Freie Universität Berlin

URL: http://dx.doi.org/10.17169/refubium-4455

► Diese Arbeit betrachtet drei Themen, die alle dem berühmten Bewegungsplanungsproblem für Roboter in der Ebene zugeordnet werden können. Beim Arbeiten mit Robotern in der Ebene…
(more)

Subjects/Keywords: motion planning; configuration space; CGAL; arrangements; computational geometry; 500 Naturwissenschaften und Mathematik::510 Mathematik::516 Geometrie; 500 Naturwissenschaften und Mathematik; 000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::005 Computerprogrammierung, Programme, Daten

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Atariah, D. (2014). Parametrisierungen und Approximationen von Flächen im Konfigurationsraum. (Thesis). Freie Universität Berlin. Retrieved from http://dx.doi.org/10.17169/refubium-4455

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Atariah, Dror. “Parametrisierungen und Approximationen von Flächen im Konfigurationsraum.” 2014. Thesis, Freie Universität Berlin. Accessed July 14, 2020. http://dx.doi.org/10.17169/refubium-4455.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Atariah, Dror. “Parametrisierungen und Approximationen von Flächen im Konfigurationsraum.” 2014. Web. 14 Jul 2020.

Vancouver:

Atariah D. Parametrisierungen und Approximationen von Flächen im Konfigurationsraum. [Internet] [Thesis]. Freie Universität Berlin; 2014. [cited 2020 Jul 14]. Available from: http://dx.doi.org/10.17169/refubium-4455.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Atariah D. Parametrisierungen und Approximationen von Flächen im Konfigurationsraum. [Thesis]. Freie Universität Berlin; 2014. Available from: http://dx.doi.org/10.17169/refubium-4455

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

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

Degree: 2011, University of Waterloo

URL: http://hdl.handle.net/10012/6172

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Chicago

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

Degree: 2018, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/22687

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Rutgers University

7.
Shabbir, Mudassir.
Some results in *computational* and combinatorial * geometry*.

Degree: PhD, Computer Science, 2014, Rutgers University

URL: https://rucore.libraries.rutgers.edu/rutgers-lib/45458/

►

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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Shabbir M. Some results in computational and combinatorial geometry. [Internet] [Doctoral dissertation]. Rutgers University; 2014. [cited 2020 Jul 14]. 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/

North Carolina State University

8. Yuhasz, George Louis. Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences.

Degree: PhD, Mathematics, 2009, North Carolina State University

URL: http://www.lib.ncsu.edu/resolver/1840.16/3825

► The Berlekamp/Massey algorithm computes the unique minimal generator of a linearly generated scalar sequence. The matrix generalization of the Berlekamp/Massey algorithm, the Matrix Berlekamp/Massey algorithm,…
(more)

Subjects/Keywords: exact linear algebra; linear recurrances; generic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yuhasz, G. L. (2009). Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/3825

Chicago Manual of Style (16^{th} Edition):

Yuhasz, George Louis. “Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences.” 2009. Doctoral Dissertation, North Carolina State University. Accessed July 14, 2020. http://www.lib.ncsu.edu/resolver/1840.16/3825.

MLA Handbook (7^{th} Edition):

Yuhasz, George Louis. “Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences.” 2009. Web. 14 Jul 2020.

Vancouver:

Yuhasz GL. Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2020 Jul 14]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3825.

Council of Science Editors:

Yuhasz GL. Berlekamp/Massey Algorithms for Linearly Generated Matrix Sequences. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/3825

9. Kilindris, Thomas. Ανάπτυξη προηγμένων αλγορίθμων υπολογιστικής γεωμετρίας στην απεικόνιση ενδοεγκεφαλικών όγκων και στη βελτιστοποίηση της στερεοτακτικής ακτινοθεραπείας.

Degree: 2016, University of Thessaly (UTH); Πανεπιστήμιο Θεσσαλίας

URL: http://hdl.handle.net/10442/hedi/38680

►

Stereotactic radiotherapy is a non-invasive therapeutic modality characterized by a high level spatial dose conformity targeting deep seated intracranial lesions. Irradiation treatment planning is of… (more)

Subjects/Keywords: Στερεοτακτική ακτινοθεραπεία; Βελτιστοποίηση; Υπολογιστική γεωμετρία; Μη γραμμικός προγραμματισμός; Stereotactic radiotherapy; Optimization; Computational geometry; Non linear programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Kilindris, T. (2016). Ανάπτυξη προηγμένων αλγορίθμων υπολογιστικής γεωμετρίας στην απεικόνιση ενδοεγκεφαλικών όγκων και στη βελτιστοποίηση της στερεοτακτικής ακτινοθεραπείας. (Thesis). University of Thessaly (UTH); Πανεπιστήμιο Θεσσαλίας. Retrieved from http://hdl.handle.net/10442/hedi/38680

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kilindris, Thomas. “Ανάπτυξη προηγμένων αλγορίθμων υπολογιστικής γεωμετρίας στην απεικόνιση ενδοεγκεφαλικών όγκων και στη βελτιστοποίηση της στερεοτακτικής ακτινοθεραπείας.” 2016. Thesis, University of Thessaly (UTH); Πανεπιστήμιο Θεσσαλίας. Accessed July 14, 2020. http://hdl.handle.net/10442/hedi/38680.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kilindris, Thomas. “Ανάπτυξη προηγμένων αλγορίθμων υπολογιστικής γεωμετρίας στην απεικόνιση ενδοεγκεφαλικών όγκων και στη βελτιστοποίηση της στερεοτακτικής ακτινοθεραπείας.” 2016. Web. 14 Jul 2020.

Vancouver:

Kilindris T. Ανάπτυξη προηγμένων αλγορίθμων υπολογιστικής γεωμετρίας στην απεικόνιση ενδοεγκεφαλικών όγκων και στη βελτιστοποίηση της στερεοτακτικής ακτινοθεραπείας. [Internet] [Thesis]. University of Thessaly (UTH); Πανεπιστήμιο Θεσσαλίας; 2016. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10442/hedi/38680.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kilindris T. Ανάπτυξη προηγμένων αλγορίθμων υπολογιστικής γεωμετρίας στην απεικόνιση ενδοεγκεφαλικών όγκων και στη βελτιστοποίηση της στερεοτακτικής ακτινοθεραπείας. [Thesis]. University of Thessaly (UTH); Πανεπιστήμιο Θεσσαλίας; 2016. Available from: http://hdl.handle.net/10442/hedi/38680

Not specified: Masters Thesis or Doctoral Dissertation

University of Waterloo

10. Grant, Elyot. Covering Problems via Structural Approaches.

Degree: 2011, University of Waterloo

URL: http://hdl.handle.net/10012/6317

► The minimum set cover problem is, without question, among the most ubiquitous and well-studied problems in computer science. Its theoretical hardness has been fully characterized –…
(more)

Subjects/Keywords: set cover; combinatorial optimization; computational geometry; quasi-uniform sampling; hitting set; apx-hard; dynamic programming; capacitated covering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Grant, E. (2011). Covering Problems via Structural Approaches. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6317

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Grant, Elyot. “Covering Problems via Structural Approaches.” 2011. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/6317.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Grant, Elyot. “Covering Problems via Structural Approaches.” 2011. Web. 14 Jul 2020.

Vancouver:

Grant E. Covering Problems via Structural Approaches. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/6317.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Grant E. Covering Problems via Structural Approaches. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6317

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

11. Tang, Xiaolong. Lifting the Abstraction Level of Compiler Transformations.

Degree: 2013, Texas A&M University

URL: http://hdl.handle.net/1969.1/151126

► Production compilers implement optimizing transformation rules for built-in types. What justifies applying these optimizing rules is the axioms that hold for built-in types and the…
(more)

Subjects/Keywords: Compiler optimization; Program analysis; Programming language; Generic programming; C++

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Tang, X. (2013). Lifting the Abstraction Level of Compiler Transformations. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/151126

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Tang, Xiaolong. “Lifting the Abstraction Level of Compiler Transformations.” 2013. Thesis, Texas A&M University. Accessed July 14, 2020. http://hdl.handle.net/1969.1/151126.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Tang, Xiaolong. “Lifting the Abstraction Level of Compiler Transformations.” 2013. Web. 14 Jul 2020.

Vancouver:

Tang X. Lifting the Abstraction Level of Compiler Transformations. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1969.1/151126.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tang X. Lifting the Abstraction Level of Compiler Transformations. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/151126

Not specified: Masters Thesis or Doctoral Dissertation

Universiteit Utrecht

12.
Sijsling, Y.
*Generic**programming* with ornaments and dependent types.

Degree: 2016, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/337070

► Modern dependently typed functional *programming* languages like Agda allow very specific restrictions to be built into datatypes by using indices and dependent types. Properly restricted…
(more)

Subjects/Keywords: Functional Programming; Generic Programming; Agda; Ornaments; Reflection; Dependent Types

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sijsling, Y. (2016). Generic programming with ornaments and dependent types. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/337070

Chicago Manual of Style (16^{th} Edition):

Sijsling, Y. “Generic programming with ornaments and dependent types.” 2016. Masters Thesis, Universiteit Utrecht. Accessed July 14, 2020. http://dspace.library.uu.nl:8080/handle/1874/337070.

MLA Handbook (7^{th} Edition):

Sijsling, Y. “Generic programming with ornaments and dependent types.” 2016. Web. 14 Jul 2020.

Vancouver:

Sijsling Y. Generic programming with ornaments and dependent types. [Internet] [Masters thesis]. Universiteit Utrecht; 2016. [cited 2020 Jul 14]. Available from: http://dspace.library.uu.nl:8080/handle/1874/337070.

Council of Science Editors:

Sijsling Y. Generic programming with ornaments and dependent types. [Masters Thesis]. Universiteit Utrecht; 2016. Available from: http://dspace.library.uu.nl:8080/handle/1874/337070

Texas A&M University

13. Ghosh, Mukulika. Fast Approximate Convex Decomposition.

Degree: 2012, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11873

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ghosh, Mukulika. “Fast Approximate Convex Decomposition.” 2012. Web. 14 Jul 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Universiteit Utrecht

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

Degree: 2014, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/294075

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

15.
Zhou, Jianguo.
Processing of *Generic* Circuits by Conductive Adhesives:
Geometrical and Rheological Considerations.

Degree: PhD, Polymer Engineering, 2007, University of Akron

URL: http://rave.ohiolink.edu/etdc/view?acc_num=akron1176968256

► Epoxy/Ni adhesives can be used as integrated circuit (IC) packaging materials due to their lower cost than epoxy/Ag adhesives with acceptable electrical conductivity. In this…
(more)

Subjects/Keywords: Generic Circuits; Epoxy/Ni Conductive Adhesives; Geometry Effects; Rheological Behaviors

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zhou, J. (2007). Processing of Generic Circuits by Conductive Adhesives: Geometrical and Rheological Considerations. (Doctoral Dissertation). University of Akron. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=akron1176968256

Chicago Manual of Style (16^{th} Edition):

Zhou, Jianguo. “Processing of Generic Circuits by Conductive Adhesives: Geometrical and Rheological Considerations.” 2007. Doctoral Dissertation, University of Akron. Accessed July 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=akron1176968256.

MLA Handbook (7^{th} Edition):

Zhou, Jianguo. “Processing of Generic Circuits by Conductive Adhesives: Geometrical and Rheological Considerations.” 2007. Web. 14 Jul 2020.

Vancouver:

Zhou J. Processing of Generic Circuits by Conductive Adhesives: Geometrical and Rheological Considerations. [Internet] [Doctoral dissertation]. University of Akron; 2007. [cited 2020 Jul 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1176968256.

Council of Science Editors:

Zhou J. Processing of Generic Circuits by Conductive Adhesives: Geometrical and Rheological Considerations. [Doctoral Dissertation]. University of Akron; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=akron1176968256

University of Michigan

16. Garcia-Ramirez, Hector J. Hybrid Techniques for Simulating Quantum Circuits using the Heisenberg Representation.

Degree: PhD, Computer Science and Engineering, 2014, University of Michigan

URL: http://hdl.handle.net/2027.42/107198

► Simulation of quantum information processing remains a major challenge with important applications in quantum computer science and engineering. *Generic* quantum-circuit simulation appears intractable for conventional…
(more)

Subjects/Keywords: Quantum-circuit Simulation; Stabilizer-based Simulation of Generic Quantum Circuits; Stabilizer Frames, Multiframes and P-blocked Multiframes; Pauli Decision Diagrams and Matrix Product Multivalued Decision Diagrams; Metric and Computational Geometry of Stabilizer States; Heisenberg Representation for Quantum Computers; Computer Science; Engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Garcia-Ramirez, H. J. (2014). Hybrid Techniques for Simulating Quantum Circuits using the Heisenberg Representation. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/107198

Chicago Manual of Style (16^{th} Edition):

Garcia-Ramirez, Hector J. “Hybrid Techniques for Simulating Quantum Circuits using the Heisenberg Representation.” 2014. Doctoral Dissertation, University of Michigan. Accessed July 14, 2020. http://hdl.handle.net/2027.42/107198.

MLA Handbook (7^{th} Edition):

Garcia-Ramirez, Hector J. “Hybrid Techniques for Simulating Quantum Circuits using the Heisenberg Representation.” 2014. Web. 14 Jul 2020.

Vancouver:

Garcia-Ramirez HJ. Hybrid Techniques for Simulating Quantum Circuits using the Heisenberg Representation. [Internet] [Doctoral dissertation]. University of Michigan; 2014. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2027.42/107198.

Council of Science Editors:

Garcia-Ramirez HJ. Hybrid Techniques for Simulating Quantum Circuits using the Heisenberg Representation. [Doctoral Dissertation]. University of Michigan; 2014. Available from: http://hdl.handle.net/2027.42/107198

University of Saskatchewan

17. Vassilev, Tzvetalin Simeonov. Optimal area triangulation.

Degree: 2005, University of Saskatchewan

URL: http://hdl.handle.net/10388/etd-08232005-111957

► Given a set of points in the Euclidean plane, we are interested in its triangulations, i.e., the maximal sets of non-overlapping triangles with vertices in…
(more)

Subjects/Keywords: computational geometry; geometric algorithms; dynamic programming; optimal triangulations; planar triangulations

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vassilev, T. S. (2005). Optimal area triangulation. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-08232005-111957

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Vassilev, Tzvetalin Simeonov. “Optimal area triangulation.” 2005. Thesis, University of Saskatchewan. Accessed July 14, 2020. http://hdl.handle.net/10388/etd-08232005-111957.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Vassilev, Tzvetalin Simeonov. “Optimal area triangulation.” 2005. Web. 14 Jul 2020.

Vancouver:

Vassilev TS. Optimal area triangulation. [Internet] [Thesis]. University of Saskatchewan; 2005. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10388/etd-08232005-111957.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vassilev TS. Optimal area triangulation. [Thesis]. University of Saskatchewan; 2005. Available from: http://hdl.handle.net/10388/etd-08232005-111957

Not specified: Masters Thesis or Doctoral Dissertation

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

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

URL: https://scholar.uwindsor.ca/etd/5198

► 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

…objects and properties of the space
in which these are embedded.
*Computational* *geometry* has… …*computational* *geometry* involve computation of distances between geometric objects. Typically, such… …3
An Incremental Linear *Programming* Based Tool for Analyzing
Gene Expression Data… …Linear *programming* formulation of Unger and Chor’s incremental algorithm… …Linear *programming* formulation of ‘180 strict containment condition’
(a) construction…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

Panigrahi SC. GEOMETRIC OPTIMIZATION IN SOME PROXIMITY AND BIOINFORMATICS PROBLEMS. [Internet] [Doctoral dissertation]. University of Windsor; 2014. [cited 2020 Jul 14]. Available from: https://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: https://scholar.uwindsor.ca/etd/5198

Universiteit Utrecht

19. Vassena, M. SVC - A prototype of a Structure-aware Version Control system.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/319987

► This thesis studies the problem of structure-aware revision control, which consists of exploiting the knowledge of the structure of data to improve the quality of…
(more)

Subjects/Keywords: Version Control System; diff3; diff; data-type generic programming

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Vassena, M. (2015). SVC - A prototype of a Structure-aware Version Control system. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/319987

Chicago Manual of Style (16^{th} Edition):

Vassena, M. “SVC - A prototype of a Structure-aware Version Control system.” 2015. Masters Thesis, Universiteit Utrecht. Accessed July 14, 2020. http://dspace.library.uu.nl:8080/handle/1874/319987.

MLA Handbook (7^{th} Edition):

Vassena, M. “SVC - A prototype of a Structure-aware Version Control system.” 2015. Web. 14 Jul 2020.

Vancouver:

Vassena M. SVC - A prototype of a Structure-aware Version Control system. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Jul 14]. Available from: http://dspace.library.uu.nl:8080/handle/1874/319987.

Council of Science Editors:

Vassena M. SVC - A prototype of a Structure-aware Version Control system. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/319987

Texas A&M University

20.
Srinivasa Raghavan, Aravind.
Improving support for *generic* *programming* in C# with associated types and constraint propagation.

Degree: 2009, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-1273

► Generics has recently been adopted to many mainstream object oriented languages, such as C# and Java. As a particular design choice, generics in C# and…
(more)

Subjects/Keywords: Constrained Generics; Generic Programming; Associated types; constraint propagation

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Srinivasa Raghavan, A. (2009). Improving support for generic programming in C# with associated types and constraint propagation. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1273

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Srinivasa Raghavan, Aravind. “Improving support for generic programming in C# with associated types and constraint propagation.” 2009. Thesis, Texas A&M University. Accessed July 14, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-1273.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Srinivasa Raghavan, Aravind. “Improving support for generic programming in C# with associated types and constraint propagation.” 2009. Web. 14 Jul 2020.

Vancouver:

Srinivasa Raghavan A. Improving support for generic programming in C# with associated types and constraint propagation. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1273.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Srinivasa Raghavan A. Improving support for generic programming in C# with associated types and constraint propagation. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1273

Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

21.
Smith, Jacob N.
Techniques in Active and *Generic* Software Libraries.

Degree: 2010, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7823

► Reusing code from software libraries can reduce the time and effort to construct software systems and also enable the development of larger systems. However, the…
(more)

Subjects/Keywords: Active libraries; concepts; generic programming; software libraries; software engineering

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Smith, J. N. (2010). Techniques in Active and Generic Software Libraries. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7823

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Smith, Jacob N. “Techniques in Active and Generic Software Libraries.” 2010. Thesis, Texas A&M University. Accessed July 14, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7823.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Smith, Jacob N. “Techniques in Active and Generic Software Libraries.” 2010. Web. 14 Jul 2020.

Vancouver:

Smith JN. Techniques in Active and Generic Software Libraries. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7823.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Smith JN. Techniques in Active and Generic Software Libraries. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7823

Not specified: Masters Thesis or Doctoral Dissertation

22.
Rodriguez, E.
*Generic**Programming* in F#.

Degree: 2015, Universiteit Utrecht

URL: http://dspace.library.uu.nl:8080/handle/1874/320196

► Datatype *generic* *programming* is a *programming* model that exploits the structural similarities of different types in order to generically define functions on families of types.…
(more)

Subjects/Keywords: generic programming; functional programming; polymorphism

…Description of the Problem
Even though datatype *generic* *programming* has existed for almost 20 years… …type systems.
4.1
Why should F# adopt Datatype *Generic* *Programming*
Programmers of the F… …inspiration the existing knowlege about datatype *generic* *programming*, it might be
possible to… …The existing methods for datatype *generic* *programming* cannot be directly implemented in F… …section introduces these features and explains their role in datatype *generic* *programming*.
4.2…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Rodriguez, E. (2015). Generic Programming in F#. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/320196

Chicago Manual of Style (16^{th} Edition):

Rodriguez, E. “Generic Programming in F#.” 2015. Masters Thesis, Universiteit Utrecht. Accessed July 14, 2020. http://dspace.library.uu.nl:8080/handle/1874/320196.

MLA Handbook (7^{th} Edition):

Rodriguez, E. “Generic Programming in F#.” 2015. Web. 14 Jul 2020.

Vancouver:

Rodriguez E. Generic Programming in F#. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2020 Jul 14]. Available from: http://dspace.library.uu.nl:8080/handle/1874/320196.

Council of Science Editors:

Rodriguez E. Generic Programming in F#. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/320196

University of Waterloo

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

Degree: 2008, University of Waterloo

URL: http://hdl.handle.net/10012/3964

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

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

Degree: PhD, 2014, University of Edinburgh

URL: http://hdl.handle.net/1842/9663

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Queens University

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

Degree: Computing, 2016, Queens University

URL: http://hdl.handle.net/1974/14017

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Notre Dame

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

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

URL: https://curate.nd.edu/show/7m01bk14753

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

University of Ottawa

27. Schultz Xavier da Silveira, Luís Fernando. Turán Triangles, Cell Covers, Road Placement and Train Scheduling .

Degree: 2020, University of Ottawa

URL: http://hdl.handle.net/10393/40569

► In this doctoral thesis, four questions related to *computational* *geometry* are considered. The first is an extremal combinatorics question regarding triangles with vertices taken from…
(more)

Subjects/Keywords: Computational Geometry; Combinatorial Optimization; Approximation Algorithms; Scheduling

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Schultz Xavier da Silveira, L. F. (2020). Turán Triangles, Cell Covers, Road Placement and Train Scheduling . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/40569

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Schultz Xavier da Silveira, Luís Fernando. “Turán Triangles, Cell Covers, Road Placement and Train Scheduling .” 2020. Thesis, University of Ottawa. Accessed July 14, 2020. http://hdl.handle.net/10393/40569.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Schultz Xavier da Silveira, Luís Fernando. “Turán Triangles, Cell Covers, Road Placement and Train Scheduling .” 2020. Web. 14 Jul 2020.

Vancouver:

Schultz Xavier da Silveira LF. Turán Triangles, Cell Covers, Road Placement and Train Scheduling . [Internet] [Thesis]. University of Ottawa; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10393/40569.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schultz Xavier da Silveira LF. Turán Triangles, Cell Covers, Road Placement and Train Scheduling . [Thesis]. University of Ottawa; 2020. Available from: http://hdl.handle.net/10393/40569

Not specified: Masters Thesis or Doctoral Dissertation

Iowa State University

28.
Laguna, Guillermo Jesus.
Multirobot deployment, coordination and tracking strategies: A *computational*-geometric approach.

Degree: 2020, Iowa State University

URL: https://lib.dr.iastate.edu/etd/17824

► This dissertation addresses three novel problems in the visual-based target tracking field using a team of mobile observers/guards. In all the problems, there is a…
(more)

Subjects/Keywords: Computational Geometry; Multi-robot Systems; Target Tracking

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Laguna, G. J. (2020). Multirobot deployment, coordination and tracking strategies: A computational-geometric approach. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/17824

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Laguna, Guillermo Jesus. “Multirobot deployment, coordination and tracking strategies: A computational-geometric approach.” 2020. Thesis, Iowa State University. Accessed July 14, 2020. https://lib.dr.iastate.edu/etd/17824.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Laguna, Guillermo Jesus. “Multirobot deployment, coordination and tracking strategies: A computational-geometric approach.” 2020. Web. 14 Jul 2020.

Vancouver:

Laguna GJ. Multirobot deployment, coordination and tracking strategies: A computational-geometric approach. [Internet] [Thesis]. Iowa State University; 2020. [cited 2020 Jul 14]. Available from: https://lib.dr.iastate.edu/etd/17824.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Laguna GJ. Multirobot deployment, coordination and tracking strategies: A computational-geometric approach. [Thesis]. Iowa State University; 2020. Available from: https://lib.dr.iastate.edu/etd/17824

Not specified: Masters Thesis or Doctoral Dissertation

29. Carolina Fernandes Molina Sanches. Geometria de superfícies em R3 do ponto de vista de contato.

Degree: 2010, Federal University of Uberlândia

URL: http://www.bdtd.ufu.br//tde_busca/arquivo.php?codArquivo=2874

►

Neste trabalho é apresentado um estudo sobre o contato de superfícies imersas no R3 com algumas subvariedades, a saber, esferas e círculos. Para este estudo… (more)

Subjects/Keywords: Geometria genérica; Contato; Singularidades; Esferas; MATEMATICA; Geometria diferencial; Generic geometry; Círculos; Contact; Singularities; Spheres; Circles

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Sanches, C. F. M. (2010). Geometria de superfícies em R3 do ponto de vista de contato. (Thesis). Federal University of Uberlândia. Retrieved from http://www.bdtd.ufu.br//tde_busca/arquivo.php?codArquivo=2874

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Sanches, Carolina Fernandes Molina. “Geometria de superfícies em R3 do ponto de vista de contato.” 2010. Thesis, Federal University of Uberlândia. Accessed July 14, 2020. http://www.bdtd.ufu.br//tde_busca/arquivo.php?codArquivo=2874.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Sanches, Carolina Fernandes Molina. “Geometria de superfícies em R3 do ponto de vista de contato.” 2010. Web. 14 Jul 2020.

Vancouver:

Sanches CFM. Geometria de superfícies em R3 do ponto de vista de contato. [Internet] [Thesis]. Federal University of Uberlândia; 2010. [cited 2020 Jul 14]. Available from: http://www.bdtd.ufu.br//tde_busca/arquivo.php?codArquivo=2874.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sanches CFM. Geometria de superfícies em R3 do ponto de vista de contato. [Thesis]. Federal University of Uberlândia; 2010. Available from: http://www.bdtd.ufu.br//tde_busca/arquivo.php?codArquivo=2874

Not specified: Masters Thesis or Doctoral Dissertation

University of Illinois – Urbana-Champaign

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

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

URL: http://hdl.handle.net/2142/88048

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Raichel, Benjamin A. “In pursuit of linear complexity in discrete and computational geometry.” 2015. Web. 14 Jul 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 Jul 14]. 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