Computational Geometry Issues In Recursive

Partitioning Based Simulation Algorithm

D. Pokrajac, Delaware State University

Marko Petkovic, University of Nis
Predrag R. Bakic, University of Pennsylvania

Novi Pazar
June 20, 2016
Thanks for Inviting Me To The Conference
 Problem 1
Material 2
Material 1

Quadratic Voxel outside

Surface Q(x)=0 barrier
Material 3

Material 4
Voxel inside
barrier
Leaf nodes D
Voxel
Non-leaf
on boundary
nodes

Recursive Partitioning Min and Max distance from voxel

Simulation to quadratic surface
Lower Bound for Minimal Distance Between Voxel and Surface

X0 X0=P+[Δx Δx Δx]T/2
Δx
R

P Δx
Δx
Surface
Q(X)=0 X’=[x’ y’ z’]

d’

X=[x y z] Constrained Optimization Problem

d′ = minሺ𝐗 − 𝐗′ሻ𝑻 ሺ𝐗 − 𝐗′ሻ

s.t.
𝑄 ሺ𝐗ሻ = 0
ሺ𝐗 ′ − 𝐗 𝟎 ሻ𝑻 ሺ𝐗 ′ − 𝐗 𝟎 ሻ− 𝑅 2 = 0
 Problem 2
Q(x) increases n

Voxel V

D
Q(x)=0 xc
xD
D
x0 

Partial volume simulation: Determine tangent plane on a locus of

points at distance D from a given quadric
 Main Claim

Consider locus L of points at distance D from surface 𝑸ሺ𝐗ሻ = 0, where 𝑸ሺ𝐗ሻ ∈

𝐶 ሺ2ሻሺ𝐷ሻ

Consider a point 𝐘𝟎 ∈ 𝐿.

Let 𝑸ሺ𝐗 𝟎 ሻ = 0 and let 𝐗 𝟎 𝐘𝟎 be normal to surface 𝑸ሺ𝐗ሻ = 0.

Then 𝐗 𝟎 𝐘𝟎 is normal to L.
Application: Partial Volume Computation

yo

xo
 Thanks So Much!
• dpokrajac@desu.edu