Pages that link to "Item:Q789728"
From MaRDI portal
The following pages link to A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form (Q789728):
Displaying 12 items.
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354) (← links)
- Aggregate operators in constraint query languages (Q696963) (← links)
- Computing a sweeping-plane in regular (``general'') position: A numerical and a symbolic solution (Q751863) (← links)
- Space sweep solves intersection of convex polyhedra (Q759486) (← links)
- A sweep-plane algorithm for computing the Euler-characteristic of polyhedra represented in Boolean form (Q1057499) (← links)
- Algorithmic aspects of alternating sum of volumes. II: Nonconvergence and its remedy (Q1181964) (← links)
- Finding the exact volume of a polyhedron. (Q1400219) (← links)
- Average weights and power in weighted voting games (Q2019323) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Uniform generation in spatial constraint databases and applications (Q2495401) (← links)
- A sweep-plane algorithm for generating random tuples in simple polytopes (Q4210961) (← links)
- Curvature and Flow in Digital Space (Q4682468) (← links)