Relevant bibliographies by topics / Computational geometry

Academic literature on the topic 'Computational geometry'

Author: Grafiati
Published: 4 June 2021
Last updated: 7 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Computational geometry.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Computational geometry"

1

SADAKANE, Kunihiko, Noriko SUGAWARA, and Takeshi TOKUYAMA. "Quantum Computation in Computational Geometry." Interdisciplinary Information Sciences 8, no. 2 (2002): 129–36. http://dx.doi.org/10.4036/iis.2002.129.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

ASANO, Tetsuo. "Computational Geometry." Journal of Japan Society for Fuzzy Theory and Systems 13, no. 2 (2001): 130–38. http://dx.doi.org/10.3156/jfuzzy.13.2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

O'Rourke, Joseph. "Computational geometry." ACM SIGACT News 23, no. 2 (May 1992): 26–28. http://dx.doi.org/10.1145/130956.130957.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

O'Rourke, J. "Computational Geometry." Annual Review of Computer Science 3, no. 1 (June 1988): 389–411. http://dx.doi.org/10.1146/annurev.cs.03.060188.002133.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Agarwal, Pankaj K., and Joseph O'Rourke. "Computational geometry." ACM SIGACT News 29, no. 3 (September 1998): 27–32. http://dx.doi.org/10.1145/300307.300310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lee, D. T. "Computational geometry." ACM Computing Surveys 28, no. 1 (March 1996): 27–31. http://dx.doi.org/10.1145/234313.234325.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mitchell, Joseph S. B., and Joseph O'Rourke. "Computational geometry." ACM SIGACT News 32, no. 3 (September 2001): 63–72. http://dx.doi.org/10.1145/500559.500562.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

O'Rourke, Joseph. "Computational geometry." ACM SIGACT News 26, no. 1 (March 1995): 14–16. http://dx.doi.org/10.1145/203610.203613.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Toussaint, Godfried T. "Computational geometry." Visual Computer 3, no. 6 (November 1988): 321–22. http://dx.doi.org/10.1007/bf01901189.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

O'Rourke, Joseph. "Computational geometry." ACM SIGACT News 25, no. 1 (March 1994): 31–33. http://dx.doi.org/10.1145/181773.181777.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Computational geometry"

1

Baer, Lawrence H. "Numerical aspects of computational geometry." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22507.

Full text
Abstract:
This thesis is concerned with the numerical issues resulting from the implementation of geometric algorithms on finite precision digital computers. From an examination of the general problem and a survey of previous research, it appears that the central problem of numerical computational geometry is how to deal with degenerate and nearly degenerate input. For some applications, such as solid modeling, degeneracy is often intended but we cannot always ascertain its existence using finite precision. For other applications, degenerate input is unwanted but nearly degenerate input is unavoidable. Near degeneracy is associated with ill-conditioning of the input and can lead to a serious loss of accuracy and program failure. These observations lead us to a discussion of problem condition in the context of computational geometry. We use the Voronoi diagram construction problem as a case study and show that problem condition can also play a role in algorithm design.
APA, Harvard, Vancouver, ISO, and other styles
2

Hussain, R. "Computational geometry using fourier analysis." Thesis, De Montfort University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391483.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Eades, Patrick Fintan. "Uncertainty Models in Computational Geometry." Thesis, University of Sydney, 2020. https://hdl.handle.net/2123/23909.

Full text
Abstract:
In recent years easily and cheaply available internet-connected devices have enabled the collection of vast amounts of data, which has driven a continued interest in efficient, elegant combinatorial algorithms with mathematical guarantees. Much of this data contains an inherent element of uncertainty; whether because of imperfect measurements, because the data contains predictions about the future, or because the data is derived from machine learning algorithms which are inherently probabilistic. There is therefore a need for algorithms which include uncertainty in their definition and give answers in terms of that uncertainty. Questions about the most likely solution, the solution with lowest expected cost or a solution which is correct with high probability are natural here. Computational geometry is the sub-field of theoretical computer science concerned with developing algorithms and data structures for geometric problems, that is problems involving points, distances, angles and shapes. In computational geometry uncertainty is included in the location of the input points, or in which potential points are included in the input. The study of uncertainty in computational geometry is relatively recent; earlier research concerned imprecise points, which are known to appear somewhere in a geometric region. More recently the focus has been on points whose location, or presence, is given by a probability distribution. In this thesis we describe the most commonly used uncertainty models which are the subject of ongoing research in computational geometry. We present specific problems in those models and present new results, both positive and negative. In Chapter 3 we consider universal solutions, and show a new lower bound on the competitive ratio of the Universal Traveling Salesman Problem. In Chapter 4 we describe how to determine if two moving entities are ever mutually visible, and how data structures can be repeatedly queried to simulate uncertainty. In Chapter 5 we describe how to construct a graph on uncertain points with high probability of being a geometric spanner, an example of redundancy protecting against uncertainty. In Chapter 6 we introduce the online ply maintenance problem, an online problem where uncertainty can be reduced at a cost, and give an optimal algorithm.
APA, Harvard, Vancouver, ISO, and other styles
4

Pirzadeh, Hormoz. "Computational Geometry with the Rotating Calipers." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0027/MQ50856.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Doskas, Michael. "Various stabbing problems in computational geometry." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66153.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pătrașcu, Mihai. "Computational geometry through the information lens." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/40526.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
Includes bibliographical references (p. 111-117).
This thesis revisits classic problems in computational geometry from the modern algorithmic perspective of exploiting the bounded precision of the input. In one dimension, this viewpoint has taken over as the standard model of computation, and has led to a powerful suite of techniques that constitute a mature field of research. In two or more dimensions, we have seen great success in understanding orthogonal problems, which decompose naturally into one dimensional problems. However, problems of a nonorthogonal nature, the core of computational geometry, have remained uncracked for many years despite extensive effort. For example, Willard asked in SODA'92 for a o(nlg n) algorithm for Voronoi diagrams. Despite growing interest in the problem, it was not successfully solved until this thesis. Formally, let w be the number of bits in a computer word, and consider n points with O(w)-bit rational coordinates. This thesis describes: * a data structure for 2-d point location with O(n) space, and 0( ... )query time. * randomized algorithms with running time 9 ... ) for 3-d convex hull, 2-d Voronoi diagram, 2-d line segment intersection, and a variety of related problems. * a data structure for 2-d dynamic convex hull, with O ( ... )query time, and O ( ... ) update time. More generally, this thesis develops a suite of techniques for exploiting bounded precision in geometric problems, hopefully laying the foundations for a rejuvenated research direction.
by Mihai Pǎtraşcu.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
7

Scibilia, Francesco. "Explicit Model Predictive Control:Solutions Via Computational Geometry." Doctoral thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for teknisk kybernetikk, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-11627.

Full text
Abstract:
The thesis is mainly focused on issues involved with explicit model predictive control approaches. Conventional model predictive control (MPC) implementation requires at each sampling time the solution of an open-loop optimal control problem with the current state as the initial condition of the optimization. Formulating the MPC problem as a multi-parametric programming problem, the online optimization effort can be moved offline and the optimal control law given as an explicitly defined piecewise affine (PWA) function with dependence on the current state. The domain where the PWA function is defined corresponds to the feasible set which is partitioned into convex regions. This makes explicit MPC solutions into promising approaches to extend the scope of applicability of MPC schemes. The online computation reduces to simple evaluations of a PWA function, allowing implementations on simple hardware and with fast sampling rates. Furthermore, the closed form of the MPC solutions allows offline analysis of the performance, providing additional insight of the controller behavior. However, explicit MPC implementations may still be prohibitively costly for large optimization problems. The offline computational effort needed to solve the multiparametric optimization problem may be discouraging, and even the online computation needed to evaluate a complex PWA controller may cause difficulties if low-cost hardware is used. The first contribution of this thesis is to propose a technique for computing approximate explicit MPC solutions for the cases where optimal explicit MPC solutions are impractical due to the offline computational effort needed and their complexity for online evaluations. This technique is based on computational geometry, a branch of computer science which focuses heavily on computational complexity since the algorithms are intended to be used on large data-sets. The approximate solution is suboptimal only over the subregion of the feasible set where constraints are active. In this subregion, the ineffective optimal explicit MPC solution is replaced by an approximation based on Delaunay tessellations and is computed from a finite number of samples of the exact solution. Finer tessellations can be obtained in order to achieve a desired level of accuracy Successively, the thesis presents a twofold contribution concerned with the computation of feasible sets for MPC and their suitable approximations. First, an alternative approach is suggested for computing the feasible set which uses set relations instead of the conventional orthogonal projection. The approach can be implemented incrementally on the length of the MPC prediction horizon, and proves to be computationally less demanding than the standard approach. Thereafter, an algorithm for computing suitable inner approximations of the feasible set is proposed, which constitutes the main contribution. Such approximations are characterized by simpler representations and preserve the essential properties of the feasible set as convexity, positive invariance, inclusion of the set of expected initial states. This contribution is particularly important in the context of finding less complex suboptimal explicit MPC solutions, where the complexity of the feasible set plays a decisive role. The last part of the thesis is concerned with robustness of nominal explicit MPC solutions to model uncertainty. In the presence of model mismatch, when the controller designed using the nominal model is applied to the real plant, the feasible set may lose its invariance property, and this means violation of constraints. Also, since the PWA control law is designed only over the feasible set, there is the technical problem that the control action is undefined if the state moves outside of this set. To deal with this issue, a tool is proposed to analyze how uncertainty on the model affects the PWA control law computed using the nominal model. Given the linear system describing the plant and the PWA control law, the algorithm presented considers the polytopic model uncertainty and constructs the maximal robust feasible set, i.e. the largest subset of the feasible set which is guaranteed to be feasible for any model in the family of models described by the polytopic uncertainty. The appendix of the thesis contains two additional contributions which are only marginally related to the main theme of the thesis. MPC approaches are often implemented as state feedback controllers. The state variables are not always measured, and in these cases a state estimation approach has to be adopted to obtain the state from the measurements. The two contributions deal with state estimation in two different applications, but not with the explicit goal of being used in MPC approaches.
APA, Harvard, Vancouver, ISO, and other styles
8

Colley, Paul. "Visibility problems and optimization in computational geometry." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ27818.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Teillaud, Monique. "Towards dynamic randomized algorithms in computational geometry /." Berlin [u.a.] : Springer, 1993. http://www.loc.gov/catdir/enhancements/fy0815/93023628-d.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Petrauskas, Karolis. "Computational Modelling of Biosensors of Complex Geometry." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2011. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20110701_105911-89480.

Full text
Abstract:
Biosensors are analytical devices mainly used to detect analytes and measure their concentrations. Mathematical modeling is widely used for optimizing and analyzing an operation of biosensors for reducing price of development of new biosensors. The object of this research is mathematical and computer models, describing an operation of biosensors, made of several parts with different properties. The dissertation covers models, formulated in one and two-dimensional spaces by partial differential equations with non-linear members, and solved numerically, using the method of finite differences. The numerical models are implemented by a computer program. An original mathematical model for a biosensor with a carbon nanotube electrode is presented in the dissertation. The conditions at which the one-dimensional mathematical model can be used instead of two-dimensional one for accurate prediction of the biosensor response are investigated. Elements, used to build models of biosensors with a complex structure, were systemized. The biosensor description language is proposed and the computer software, simulating an operation of biosensors in the one-dimensional space and a rectangular domain of the two-dimensional space, is developed. An adequateness of the model for the biosensor with the carbon nanotube electrode and the impact of structural and geometrical properties on a response of the biosensor were investigated, performing computer experiments using the developed software.
Biojutikliai yra įrenginiai, skirti medžiagoms aptikti bei jų koncentracijoms matuoti. Siekiant sumažinti biojutiklių gamybos kaštus yra pasitelkiamas matematinis biojutikliuose vykstančių procesų modeliavimas. Disertacijoje nagrinėjami matematiniai ir kompiuteriniai biojutiklių modeliai, aprašantys biojutiklių, sudarytų iš kelių, skirtingas savybes turinčių dalių, veikimą. Nagrinėjami modeliai yra formuluojami vienmatėje bei dvimatėje erdvėse, aprašomi diferencialinėmis lygtimis dalinėmis išvestinėmis su netiesiniais nariais ir yra sprendžiami skaitiškai, naudojant baigtinių skirtumų metodą. Skaitiniai modeliai yra įgyvendinami kompiuterine programa. Disertacijoje pateikiamas originalus matematinis modelis biojutikliui su anglies nanovamzdelių elektrodu, nustatyti kriterijai, apibrėžiantys, kada biojutiklį su perforuota membrana galima modeliuoti vienmačiu modeliu. Darbe susisteminti elementai, naudojami biojutiklių modelių formulavimui, pagrindinį dėmesį skiriant biojutiklio struktūrinėms savybėms modeliuoti. Apibrėžta biojutiklių modelių aprašo kalba ir sukurta programinė įranga, leidžianti modeliuoti biojutiklių veikimą vienmačiais modeliais arba modeliais, formuluojamais stačiakampėje dvimatės erdvės srityje. Taikant sukurtą biojutiklių modeliavimo programinę įrangą, ištirtas biojutiklio su anglies nanovamzdelių elektrodu modelio adekvatumas ir struktūrinių bei geometrinių savybių įtaka biojutiklio elgsenai.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Computational geometry"

1

Márquez, Alberto, Pedro Ramos, and Jorge Urrutia, eds. Computational Geometry. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34191-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

de Berg, Mark, Marc van Kreveld, Mark Overmars, and Otfried Cheong Schwarzkopf. Computational Geometry. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-04245-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

de Berg, Mark, Otfried Cheong, Marc van Kreveld, and Mark Overmars. Computational Geometry. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-77974-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Preparata, Franco P., and Michael Ian Shamos. Computational Geometry. New York, NY: Springer New York, 1985. http://dx.doi.org/10.1007/978-1-4612-1098-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

de Berg, Mark, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-662-03427-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pawar, Akhilesh. Computational Geometry. New Delhi, India: Campus Books International, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

1944-, Toussaint Godfried T., ed. Computational geometry. New York: IEEE, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

1944-, Toussaint Godfried T., ed. Computational geometry. Amsterdam: North-Holland, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Bokowski, Jürgen. Computational synthetic geometry. Berlin: Springer-Verlag, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Emiris, Ioannis Z., Frank Sottile, and Thorsten Theobald, eds. Nonlinear Computational Geometry. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-1-4419-0999-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Computational geometry"

1

Beichl, Isabel M., Javier Bernal, Christoph Witzgall, and Francis Sullivan. "Computational Geometry." In Encyclopedia of Operations Research and Management Science, 241–46. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_142.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

de Berg, Mark, Marc van Kreveld, Mark Overmars, and Otfried Cheong Schwarzkopf. "Computational Geometry." In Computational Geometry, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-04245-8_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Skiena, Steven S. "Computational Geometry." In Texts in Computer Science, 621–76. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-54256-6_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Komzsik, Louis. "Computational geometry." In Applied Calculus of Variations for Engineers, 155–73. Third edition. | Boca Raton, FL : CRC Press/Taylor and Francis, [2020]: CRC Press, 2019. http://dx.doi.org/10.1201/9781003009740-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Forišek, Michal, and Monika Steinová. "Computational Geometry." In Explaining Algorithms Using Metaphors, 31–57. London: Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-5019-0_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Skiena, Steven S. "Computational Geometry." In The Algorithm Design Manual, 562–619. London: Springer London, 2012. http://dx.doi.org/10.1007/978-1-84800-070-4_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

de Berg, Mark, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. "Computational Geometry." In Computational Geometry, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/978-3-662-03427-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wagon, Stan. "Computational Geometry." In Mathematica in Action, 399–422. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-75477-2_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Wagon, Stan. "Computational Geometry." In Mathematica® in Action, 485–506. New York, NY: Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-1454-0_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Devillers, Olivier. "Computational geometry and discrete computations." In Discrete Geometry for Computer Imagery, 315–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-62005-2_27.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computational geometry"

1

Chazelle, Bernard. "Computational geometry." In the twenty-sixth annual ACM symposium. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/195058.195110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Conte, A., V. Demichelis, F. Fontanella, and I. Galligani. "Computational Geometry." In Workshop. WORLD SCIENTIFIC, 1993. http://dx.doi.org/10.1142/9789814536370.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Aggarwal, Alok, Bernard Chazelle, Leo Guibas, Colm O'Dunlaing, and Chee Yap. "Parallel computational geometry." In 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). IEEE, 1985. http://dx.doi.org/10.1109/sfcs.1985.42.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Karasik, Y. B., and M. Sharir. "Optical computational geometry." In the eighth annual symposium. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/142675.142723.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lanzagorta, Marco, and Jeffrey K. Uhlmann. "Quantum computational geometry." In Defense and Security, edited by Eric Donkor, Andrew R. Pirich, and Howard E. Brandt. SPIE, 2004. http://dx.doi.org/10.1117/12.541624.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Alliez, Pierre, and Andreas Fabri. "Computational geometry algorithms library." In ACM SIGGRAPH ASIA 2009 Courses. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1665817.1665821.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Alliez, Pierre, Andreas Fabri, and Efi Fogel. "Computational geometry algorithms library." In ACM SIGGRAPH 2008 classes. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1401132.1401160.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Greene, Daniel H., and F. Frances Yao. "Finite-resolution computational geometry." In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). IEEE, 1986. http://dx.doi.org/10.1109/sfcs.1986.19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Knight, A., J. May, J. McAffer, T. Nguyen, and J. R. Sack. "A computational geometry workbench." In the sixth annual symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/98524.98602.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hart, George W. "Computational geometry for sculpture." In the seventeenth annual symposium. New York, New York, USA: ACM Press, 2001. http://dx.doi.org/10.1145/378583.378696.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Computational geometry"

1

Zolnowsky, J. Topics in Computational Geometry. Office of Scientific and Technical Information (OSTI), June 2018. http://dx.doi.org/10.2172/1453953.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hansen, Mark D. Results in Computational Geometry: Geometric Embeddings and Query- Retrieval Problems. Fort Belvoir, VA: Defense Technical Information Center, November 1990. http://dx.doi.org/10.21236/ada230380.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Michalski, A,, D. Andersson, R. Rossi, and C. Soriano. D7.1 DELIVERY OF GEOMETRY AND COMPUTATIONAL MODEL. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.020.

Full text
Abstract:
This document describes the industrial application, on which the developments of the project are implemented, and the CFD set-up. The developments are implemented over six analysis cases with increasing complexity starting from a 2D geometry with mean wind inflow to a 3D geometry with turbulent inflow and real-time shape optimization. The application represents the CAARC tall building model, which has served as a benchmark model for many studies since the 1970’s when it was first developed. Base moments (bending and torsional moments) of the building are extracted for validation by comparison of the results with the benchmark study. Page 3 of 19 Deliverable 7.1
APA, Harvard, Vancouver, ISO, and other styles
4

Thompson, David C., Joseph Maurice Rojas, and Philippe Pierre Pebay. Computational algebraic geometry for statistical modeling FY09Q2 progress. Office of Scientific and Technical Information (OSTI), March 2009. http://dx.doi.org/10.2172/984161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kipnis, Shlomo. Three Methods for Range Queries in Computational Geometry. Fort Belvoir, VA: Defense Technical Information Center, March 1989. http://dx.doi.org/10.21236/ada210830.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dobkin, David. AASERT: Software Tools for Experimentation in Computational Geometry. Fort Belvoir, VA: Defense Technical Information Center, February 2001. http://dx.doi.org/10.21236/ada391643.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Magnuson, Alan, Christopher Deschenes, and Ali Merchant. Automated Preparation of Geometry for Computational Applications Final Report. Fort Belvoir, VA: Defense Technical Information Center, January 2011. http://dx.doi.org/10.21236/ada542742.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Stiller, Peter. Algebraic Geometry and Computational Algebraic Geometry for Image Database Indexing, Image Recognition, And Computer Vision. Fort Belvoir, VA: Defense Technical Information Center, October 1999. http://dx.doi.org/10.21236/ada384588.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Salari, K., and M. McWherter-Payne. Computational Flow Modeling of a Simplified Integrated Tractor-Trailer Geometry. Office of Scientific and Technical Information (OSTI), September 2003. http://dx.doi.org/10.2172/15006457.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

McWherter-Payne, Mary Anna, and Kambiz Salari. Computational flow modeling of a simplified integrated tractor-trailer geometry. Office of Scientific and Technical Information (OSTI), September 2003. http://dx.doi.org/10.2172/918359.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Computational geometry' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography