HlG4399/Mean-Value-Coordinates-for-Arbitrary-Planar-Polygons HlG4399/Mean-Value-Coordinates-for-Arbitrary-Planar-Polygons

  • Stars
    star
    4
  • Rank 3,304,323 (Top 66 %)
  • Language
  • Created about 7 years ago
  • Updated almost 7 years ago
Twitter logo Share LinkedIn logo Share Facebook logo Share
HlG4399/Mean-Value-Coordinates-for-Arbitrary-Planar-Polygons
github

HlG4399

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

MiniImageFrame(OpenCV).zip is used for Image Warping,and MiniMeshFrame.zip is used for Mesh Parameterization.If you want to use MiniMeshFrame.zip,you should download the folder,"Manifold_Open_With_One_Boundary",and you can use the model inside to test the program.

More Repositories

1

FRSVT

I implemented the fllowing article by Matlab.Refrence:Oh T H, Matsushita Y, Tai Y W, et al. Fast Randomized Singular Value Thresholding for Low-rank Optimization[J]. IEEE Transactions on Pattern Analysis & Machine Intelligence, 2015, PP(99):1-1.Abstract:Rank minimization can be converted into tractable surrogate problems, such as Nuclear Norm Minimization (NNM) and Weighted NNM (WNNM). The problems related to NNM, or WNNM, can be solved iteratively by applying a closed-form proximal operator, called Singular Value Thresholding (SVT), or Weighted SVT, but they suffer from high computational cost of Singular Value Decomposition (SVD) at each iteration. We propose a fast and accurate approximation method for SVT, that we call fast randomized SVT (FRSVT), with which we avoid direct computation of SVD. The key idea is to extract an approximate basis for the range of the matrix from its compressed matrix. Given the basis, we compute partial singular values of the original matrix from the small factored matrix. In addition, by developping a range propagation method, our method further speeds up the extraction of approximate basis at each iteration. Our theoretical analysis shows the relationship between the approximation bound of SVD and its effect to NNM
MATLAB
26
star
2

LeetCode-Answers

C++
5
star
3

Vibe-Algorithm-2017GMCM

MATLAB
4
star
4

Useless-Super-Powers

Each player can choose one of three superpowers that seem completely useless when creating a character. Two of the three options must be interacting. Generally speaking, there must be five or six players and your super power to form a combo. The key is to see the number of players and the scale of the game (of course, this game is bound to have a lot of bugs). There are many conditions for the final victory. Everyone starts with Randomly obtain a victory condition. In general, multiple players' super power can get a chance to win. When a player's winning condition is reached or is about to be reached, the system issues an announcement to all players and counts down. If other players can block the winning condition within a specified time, the player cannot win. At this time, all players work together. Find out how to stop the player from winning.
C#
2
star
5

A-Primer-on-Repeatable-Random-Numbers

I used C # and Matlab to do some interesting experiments on the distribution of random numbers.
C#
1
star