![](images/graphics/blank.gif)
Convex hull
-
Ebook Algorithms in C: Part 2 includes contents: Chapter 24: elementary geometric methods, chapter 25: finding the convex hull, chapter 26: range searching, chapter 27: geometric intersection, chapter 28: closest-point problems, chapter 29: elementary graph algorithms, chapter 30: connectivity, chapter 31: weighted graphs, chapter 32: directed graphs, chapter 33: network flow, chapter 34: matching, chapter 35: random numbers, chapter 36: arithmetic, chapter 37: gaussian elimination, chapter 38: curve fitting, chapter 39: integration, chapter 40: parallel algorithms chapter 41: fast fourier ...
313p
haojiubujain08
01-11-2023
3
1
Download
-
In the paper "Local Polynomial Convexity of Certain Graphs in C²", the authors employ the theory of plurisubharmonic functions and plurisubharmonic hulls to attack the problem. More precisely, the authors construct nonnegative smooth functions vanishing exactly on Lf .
10p
runordie5
04-07-2022
7
2
Download
-
In the dissertation, we consider the problem of finding the shortest path between two points along a sequence of adjacent triangles in a general setting. The sequence of triangles is replaced by a sequence of ordered line segments. The 3D space is replaced by a Euclidean space.
91p
caphesuadathemtieu
02-03-2022
13
3
Download
-
Neuroblastoma Tumor (NT) is one of the most aggressive types of infant cancer. Essential to accurate diagnosis and prognosis is cellular quantitative analysis of the tumor. Counting enormous numbers of cells under an optical microscope is error-prone.
16p
vikentucky2711
26-11-2020
19
1
Download
-
Lecture Design and Analysis of Algorithms - Lecture 2: Divide and conquer. In this chapter, you will learn to: Paradigm, convex hull, median finding, divide and conquer convex hull.
7p
nanhankhuoctai3
25-05-2020
14
0
Download
-
Given a finite set D of n planar discs whose centers are distributed randomly. We are interested in the expected number of extreme discs of the convex hull of D. We show that the expected number of extreme discs is at most O(log2n) for any distribution.
6p
viposeidon2711
17-09-2019
13
0
Download
-
(bq) part 2 book "computational geometry - algorithms and applications" has contents: delaunay triangulations, more geometric data structures, convex hulls, binary space partitions, robot motion planning, quadtrees, visibility graphs, simplex range searching.
196p
bautroibinhyen20
06-03-2017
77
4
Download
-
We investigate the relationship between an open simply-connected region Ω ⊂ S2 and the boundary Y of the hyperbolic convex hull in H3 of S2 \ Ω. A counterexample is given to Thurston’s conjecture that these spaces are related by a 2-quasiconformal homeomorphism which extends to the identity map on their common boundary, in the case when the homeomorphism is required to respect any group of M¨bius transformations which preserves Ω.
0p
tuanloccuoi
04-01-2013
57
7
Download
-
We give sufficient conditions so that the union of two graphs with CR isolated singularities in C2 is locally polynomially convex at a singularly point. Using this result and some ideas in previous work, we obtain a new result about local approximation continuous function. 1. Introduction ˆ We recall that for a given compact K in Cn , by K we denote the polynomial convex hull of K i.e., ˆ K = {z ∈ Cn : |p(z)| ≤ p K for every polynomial p in Cn }. ˆ We say that K is polynomially convex if K = K ....
5p
tuanlocmuido
19-12-2012
33
1
Download
-
In this paper we give results about polynomial approximation on the closed polydisk in Cn . 1. Introduction Let X be a compact subset of Cn . By C(X) we denote the space of all continuous complex-valued functions on X, with norm f X = max{|f (z)| : z ∈ X}, and let P (X) denote the closure of set of polynomials in C(X). The polynomially convex hull of X will ˆ be denoted by X and difined by ˆ X = {z ∈ Cn : |p(z)| p X for every polynomial p}.
6p
tuanlocmuido
19-12-2012
36
1
Download
CHỦ ĐỀ BẠN MUỐN TÌM
![](images/graphics/blank.gif)