On computing general position views of data in three dimensions

Keyphrases

• General Position 100%
• Original Problem 100%
• Two-point 75%
• Exact Solutions 50%
• Computational Geometry 50%
• Non-degeneracy 50%
• Vertical Plane 50%
• Worst-case Complexity 25%
• Non-degenerate 25%
• Line Segments 25%
• Time Algorithm 25%
• Spatial Data 25%
• Perturbation Method 25%
• Preprocessing Techniques 25%
• Approximate Solution 25%
• Approximation Methods 25%
• Post-processing Techniques 25%
• Vertical Line 25%
• Rigid Transformation 25%
• Two-line 25%
• Jitter 25%
• Low-degree Polynomials 25%
• Polynomial Time Solution 25%
• Degeneracy Analysis 25%

Mathematics

• Nondegeneracy 100%
• Three-Dimension 100%
• Vertical Plane 100%
• Minimizes 50%
• Worst Case 50%
• Running Time 50%
• Polynomial Time 50%
• Postprocessing 50%
• Perturbation Theory 50%
• Line Segment 50%
• Approximate Solution 50%
• Low Degree 50%
• Vertical Line 50%
• Spatial Data 50%

Computer Science

• Approximation (Algorithm) 100%
• Computational Geometry 100%
• Vertical Plane 100%
• Case Complexity 50%
• Polynomial Time 50%
• Approximate Solution 50%
• Rigid Transformation 50%
• Preprocessing Step 50%
• Degree Polynomial 50%
• Postprocessing Step 50%