Sökning: "Convex hull"

Visar resultat 1 - 5 av 15 avhandlingar innehållade orden Convex hull.

  1. 1. Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results

    Författare :Magdalene Grantson Borgelt; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; control; Datalogi; numerical analysis; Convex Partition; Computer science; Triangulation; kontroll; system; numerisk analys; systems; Fixed-Parameter Algorithm; Spanning Tree;

    Sammanfattning : In this thesis I study two-dimensional geometric optimization problems for which it is difficult to find efficient, exact, deterministic algorithms. All known solutions to these problems require time that is exponential in the total size of the input. LÄS MER

  3. 2. Robust Water Balance Modeling with Uncertain Discharge and Precipitation Data : Computational Geometry as a New Tool

    Författare :José-Luis Guerrero; Sven Halldin; Stefan Uhlenbrook; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Alpha shape; Convex hull; Depth function; Discharge; Hydrological models; Honduras; Model calibration; Parameter-value estimation; Precipitation; Rating curve; Robust; Robustness; Uncertainty estimation; Water resources.; Alfaform; avbördningskurva; djupfunktion; Honduras; hydrologiska modeller; konvext hölje; modellkalibrering; nederbörd; osäkerhetsskattning; parametervärdesskattning; robust; robusthet; vattenföring; vattenresurser; Hydrology; Hydrologi;

    Sammanfattning : Models are important tools for understanding the hydrological processes that govern water transport in the landscape and for prediction at times and places where no observations are available. The degree of trust placed on models, however, should not exceed the quality of the data they are fed with. LÄS MER

  4. 3. Fixed parameter algorithms and other results for convex patitions

    Författare :Magdalene Grantson Borgelt; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : It is known that the minimum edge length convex partition MWCP of polygons with holes (an example of a PSLG) is NP-hard. Partitioning polygons with holes into the minimum number of convex polygons MNCP is also known to be NP-hard. LÄS MER

  5. 4. Numerical prediction of propeller induced hull pressure pulses and noise

    Författare :Muye Ge; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; RANS; Transition; IDDES; Cavitation; Pressure pulses; Sheet cavitation inception; Ship noise; k − ω SST; FWH acoustic analogy; Hydroacoustics;

    Sammanfattning : An operating marine propeller is one of the major sources inducing hull pressure pulses, onboard noise and vibration as well as underwater radiated noise. There are rising concerns of environmental impacts and comfort and welfare of passengers and crews due to these negative effects. LÄS MER

  7. 5. On Face Vectors and Resolutions

    Författare :Afshin Goodarzi; Anders Björner; Volkmar Welker; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis consist of the following three papers.Convex hull of face vectors of colored complexes. In this paper we verify a conjecture by Kozlov (Discrete ComputGeom18(1997) 421–431), which describes the convex hull of theset of face vectors ofr-colorable complexes onnvertices. LÄS MER